Angelo Impedovo
Research Subjects
Angelo Impedovo has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Corrado Loglisci
Department Computer Science, Università ”Aldo Moro” degli studi di Bari, Bari, Italy
6 shared publications - Michelangelo Ceci
University of Bari Aldo Moro, Bari, Italy
6 shared publications - Giuseppe Rizzo
Niuma s.r.l.
5 shared publications Michelangelo Ceci
University of Bari “Aldo Moro
3 shared publicationsDonato Malerba
2 shared publications- Donato Malerba
University of Bari
2 shared publications
Latest Publications
- 21 July 2026
- Published by Springer Nature
- p. 225-235
Leveraging Foundational Time-Series Models for Zero-Shot Appliance-Level Load Forecasting
- 21 July 2026
- Published by Springer Nature
- p. 225-235
Leveraging Foundational Time-Series Models for Zero-Shot Appliance-Level Load Forecasting
- 28 January 2025
- Published by Springer Nature
- p. 116-131
Open-Set Named Entity Recognition: A Preliminary Study
- 28 January 2025
- Published by Springer Nature
- p. 116-131
Open-Set Named Entity Recognition: A Preliminary Study
- 1 January 2025
- Published by Springer Nature
- p. 541-552
On the Effectiveness of Non-negative Matrix Factorization for Text Open-Set Recognition
- 1 January 2025
- Published by Springer Nature
- p. 541-552
On the Effectiveness of Non-negative Matrix Factorization for Text Open-Set Recognition
- Open Access
- 2 July 2024
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 62 (5) , 1455-1492
Heuristic approaches for non-exhaustive pattern-based change detection in dynamic networks
Dynamic networks are ubiquitous in many domains for modelling evolving graph-structured data and detecting changes allows us to understand the dynamic of the domain represented. A category of computational solutions is represented by the pattern-based change detectors (PBCDs), which are non-parametric unsupervised change detection methods based on observed changes in sets of frequent patterns over time. Patterns have the ability to depict the structural information of the sub-graphs, becoming a useful tool in the interpretation of the changes. Existing PBCDs often rely on exhaustive mining, which corresponds to the worst-case exponential time complexity, making this category of algorithms inefficient in practice. In fact, in such a case, the pattern mining process is even more time-consuming and inefficient due to the combinatorial explosion of the sub-graph pattern space caused by the inherent complexity of the graph structure. Non-exhaustive search strategies can represent a possible approach to this problem, also because not all the possible frequent patterns contribute to changes in the time-evolving data. In this paper, we investigate the viability of different heuristic approaches which prevent the complete exploration of the search space, by returning a concise set of sub-graph patterns (compared to the exhaustive case). The heuristics differ on the criterion used to select representative patterns. The results obtained on real-world and synthetic dynamic networks show that these solutions are effective, when mining patterns, and even more accurate when detecting changes.
- 2 July 2024
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 62 (5) , 1455-1492
Open AccessHeuristic approaches for non-exhaustive pattern-based change detection in dynamic networks
Dynamic networks are ubiquitous in many domains for modelling evolving graph-structured data and detecting changes allows us to understand the dynamic of the domain represented. A category of computational solutions is represented by the pattern-based change detectors (PBCDs), which are non-parametric unsupervised change detection methods based on observed changes in sets of frequent patterns over time. Patterns have the ability to depict the structural information of the sub-graphs, becoming a useful tool in the interpretation of the changes. Existing PBCDs often rely on exhaustive mining, which corresponds to the worst-case exponential time complexity, making this category of algorithms inefficient in practice. In fact, in such a case, the pattern mining process is even more time-consuming and inefficient due to the combinatorial explosion of the sub-graph pattern space caused by the inherent complexity of the graph structure. Non-exhaustive search strategies can represent a possible approach to this problem, also because not all the possible frequent patterns contribute to changes in the time-evolving data. In this paper, we investigate the viability of different heuristic approaches which prevent the complete exploration of the search space, by returning a concise set of sub-graph patterns (compared to the exhaustive case). The heuristics differ on the criterion used to select representative patterns. The results obtained on real-world and synthetic dynamic networks show that these solutions are effective, when mining patterns, and even more accurate when detecting changes.
- 9 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Supplier qualification document recognition through open-set recognition
Large and medium-sized manufacturing companies are concerned with maintaining their supplier registries with well-reputed suppliers sourced over time. Every supplier periodically undergoes rigorous qualification processes where procurement officers assess, among other factors, the supplier document compliance status. To this end, procurement officers periodically ask suppliers, via digital e-procurement platforms, for qualification documents of different categories. Conversely, suppliers promptly answer by handing out such documents that can, maliciously or inadvertently, be wrong. When wrong qualification documents remain undetected, and the associated suppliers are qualified, a threat to the overall business arises: procurement officers may entrust purchase orders to not compliant suppliers with unpredictable performances. Our claim is that equipping e-procurement platforms with document recognition based on supervised open-set recognition (OSR) could mitigate the problem. In particular, we deem OSR solutions suitable for supplier qualification document recognition due to their simultaneous abilities of i) recognizing documents belonging to relevant categories and ii) rejecting those belonging to unknown categories. Quantitative and qualitative results from a real-world case study in partnership with an Italian manufacturing company show that the proposed solution is viable.
- 9 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Supplier qualification document recognition through open-set recognition
Large and medium-sized manufacturing companies are concerned with maintaining their supplier registries with well-reputed suppliers sourced over time. Every supplier periodically undergoes rigorous qualification processes where procurement officers assess, among other factors, the supplier document compliance status. To this end, procurement officers periodically ask suppliers, via digital e-procurement platforms, for qualification documents of different categories. Conversely, suppliers promptly answer by handing out such documents that can, maliciously or inadvertently, be wrong. When wrong qualification documents remain undetected, and the associated suppliers are qualified, a threat to the overall business arises: procurement officers may entrust purchase orders to not compliant suppliers with unpredictable performances. Our claim is that equipping e-procurement platforms with document recognition based on supervised open-set recognition (OSR) could mitigate the problem. In particular, we deem OSR solutions suitable for supplier qualification document recognition due to their simultaneous abilities of i) recognizing documents belonging to relevant categories and ii) rejecting those belonging to unknown categories. Quantitative and qualitative results from a real-world case study in partnership with an Italian manufacturing company show that the proposed solution is viable.
- 9 March 2023
- Published by Springer Nature
- p. 156-166
Intelligent Robotic Process Automation for Supplier Document Management on E-Procurement Platforms
- 9 March 2023
- Published by Springer Nature
- p. 156-166
Intelligent Robotic Process Automation for Supplier Document Management on E-Procurement Platforms
- 20 November 2022
- Published by Springer Nature
- p. 60-74
Exploiting Named Entity Recognition for Information Extraction from Italian Procurement Documents: A Case Study
- 20 November 2022
- Published by Springer Nature
- p. 60-74
Exploiting Named Entity Recognition for Information Extraction from Italian Procurement Documents: A Case Study
- 15 October 2020
- Published by Springer Nature
- p. 451-467
Simultaneous Process Drift Detection and Characterization with Pattern-Based Change Detectors
- 15 October 2020
- Published by Springer Nature
- p. 451-467
Simultaneous Process Drift Detection and Characterization with Pattern-Based Change Detectors
- Open Access
- 1 March 2020
- Published by Elsevier in Knowledge-Based Systems
- Vol. 192, 105303
jKarma: A highly-modular framework for pattern-based change detection on evolving data
- 1 March 2020
- Published by Elsevier in Knowledge-Based Systems
- Vol. 192, 105303
Open AccessjKarma: A highly-modular framework for pattern-based change detection on evolving data
- 15 January 2020
- Published by Springer Nature
- p. 137-152
Exploiting Pattern Set Dissimilarity for Detecting Changes in Communication Networks
- 15 January 2020
- Published by Springer Nature
- p. 137-152
Exploiting Pattern Set Dissimilarity for Detecting Changes in Communication Networks