Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Capturing and anticipating user intents in data analytics via knowledge graphs

  • Pons Recasens, Gerard|||0000-0003-2225-3255
  • Bilalli, Besim|||0000-0002-0575-2389
  • Queralt Calafat, Anna|||0000-0003-2782-2955
In today’s data-driven world, the ability to extract meaningful information from data is becoming essential for businesses, organizations and researchers. For this purpose, a wide range of tools and systems exists addressing data-related tasks, from data integration, preprocessing and modeling, to the interpretation and evaluation of the results. As data continues to grow in volume and complexity, there is an increasing need for advanced yet user-friendly tools, such as intelligent discovery assistants (IDAs) or automated machine learning (AutoML) systems, that facilitate the user’s interaction with data. This enables non-expert users to effectively leverage powerful data analytics techniques. However, the use of these tools still requires non-trivial user input that cannot be anticipated from the analytical problem’s data alone, but must be tailored to each individual user and their specific intents. To this end, this work explores the use of Knowledge Graphs (KG) as a foundational representation for capturing complex analytics workflows, as well as information about the users, their intents and their feedback, in order to facilitate user interaction with IDAs or AutoML tools. This is achieved through established techniques from recommender systems, in particular a link prediction approach based on KG embeddings and graph neural networks. Experimental results show that the proposed method effectively captures the graph structure and produces meaningful suggestions for users. To demonstrate the feasibility of the approach, a working prototype is presented., This work is supported by the Horizon Europe Programme under GA.101093164 (ExtremeXP) and the Spanish Ministerio de Ciencia e Innovación under project PID2023-152841OAI00/AEI/10.13039/501100011033 (TALC)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Reproducible experiments for generating pre-processing pipelines for AutoETL

  • Giovanelli, Joseph
  • Bilalli, Besim|||0000-0002-0575-2389
  • Abelló Gamazo, Alberto|||0000-0002-3223-2186
  • Silva Coira, Fernando
  • de Bernardo Roca, Guillermo
This work is a companion reproducibility paper of the experiments and results reported in Giovanelli et al. (2022), where data pre-processing pipelines are evaluated in order to find pipeline prototypes that reduce the classification error of supervised learning algorithms. With the recent shift towards data-centric approaches, where instead of the model, the dataset is systematically changed for better model performance, data pre-processing is receiving a lot of attention. Yet, its impact over the final analysis is not widely recognized, primarily due to the lack of publicly available experiments that quantify it. To bridge this gap, this work introduces a set of reproducible experiments on the impact of data pre-processing by providing a detailed reproducibility protocol together with a software tool and a set of extensible datasets, which allow for all the experiments and results of our aforementioned work to be reproduced. We introduce a set of strongly reproducible experiments based on a collection of intermediate results, and a set of weakly reproducible experiments (Lastra-Diaz, 0000) that allows reproducing our end-to-end optimization process and evaluation of all the methods reported in our primary paper. The reproducibility protocol is created in Docker and tested in Windows and Linux. In brief, our primary work (i) develops a method for generating effective prototypes, as templates or logical sequences of pre-processing transformations, and (ii) instantiates the prototypes into pipelines, in the form of executable or physical sequences of actual operators that implement the respective transformations. For the first, a set of heuristic rules learned from extensive experiments are used, and for the second techniques from Automated Machine Learning (AutoML) are applied., This work is partially supported by the EU’s Horizon Programme call, under Grant Agreements No. 101093164 (ExtremeXP) and the DOGO4ML project, funded by the Spanish Ministerio de Ciencia e Innovación under the project/funding scheme PID2020-117191RB-I00 / AEI / 10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Gestió de dades massives

  • Abelló Gamazo, Alberto|||0000-0002-3223-2186
  • Bilalli, Besim|||0000-0002-0575-2389
Aquest article pretén donar una visió general del que és la gestió de dades massives, la seva problemàtica i com s’han d’abordar les solucions. La principal dificultat és que no existeix una solució genèrica i s’ha de construir a mida de cada organització., Aquest treball està parcialment finançat per la Comissió Europea sota l’acord 101093164, corresponent al projecte ExtremeXP., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Improving continual knowledge graph embedding via informed initialization

  • Pons Recasens, Gerard|||0000-0003-2225-3255
  • Bilalli, Besim|||0000-0002-0575-2389
  • Queralt Calafat, Anna|||0000-0003-2782-2955
Knowledge Graphs (KGs) represent knowledge as structured graphs of entities and their relationships. Knowledge Graph Embeddings (KGEs) enable learning and inference over KGs by representing their entities and relations as continuous vectors. Many KGs are frequently updated, requiring their KGEs to adapt to these changes. Continual learning methods for KGEs address this by incorporating new embeddings while updating existing ones to account for the new facts without retraining from scratch. A necessary step in these methods is the initialization of new embeddings, which has an important impact both on the accuracy of the resulting embeddings, and in the time required for their training. Current continual learning methods either use a random initialization as in non-continual scenarios, ignoring relevant information in existing embeddings, or rely on a model-dependent initialization, which is only compatible with specific KGE training models. We propose a novel informed embedding initialization strategy that can be seamlessly integrated into existing continual learning methods for KGEs. Our approach leverages the KG schema along with previously learned embeddings to generate semantically informed initial representations at every continual learning step, enhancing knowledge acquisition while reducing catastrophic forgetting in the final embeddings obtained. Experimental results show that our strategy improves the predictive performance of the resulting KGEs and enhances knowledge retention. Moreover, it accelerates the learning process, reducing the number of epochs, and thus the time required to incrementally learn new embeddings. Finally, our evaluation demonstrates that these benefits are consistent regardless of the KGE learning model used., This work is supported by the Horizon Europe Programme under GA.101093164 (ExtremeXP) and the Spanish Ministerio de Ciencia e Innovación under project PID2023-152841OA-I00/ AEI/10.13039/501100011033 (TALC)., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Reproducible experiments for generating pre-processing pipelines for AutoETL

  • Giovanelli, Joseph
  • Bilalli, Besim
  • Abelló Gamazo, Alberto
  • Silva Coira, Fernando
  • de Bernardo Roca, Guillermo
This work is a companion reproducibility paper of the experiments and results reported in Giovanelli et al. (2022), where data pre-processing pipelines are evaluated in order to find pipeline prototypes that reduce the classification error of supervised learning algorithms. With the recent shift towards data-centric approaches, where instead of the model, the dataset is systematically changed for better model performance, data pre-processing is receiving a lot of attention. Yet, its impact over the final analysis is not widely recognized, primarily due to the lack of publicly available experiments that quantify it. To bridge this gap, this work introduces a set of reproducible experiments on the impact of data pre-processing by providing a detailed reproducibility protocol together with a software tool and a set of extensible datasets, which allow for all the experiments and results of our aforementioned work to be reproduced. We introduce a set of strongly reproducible experiments based on a collection of intermediate results, and a set of weakly reproducible experiments (Lastra-Diaz, 0000) that allows reproducing our end-to-end optimization process and evaluation of all the methods reported in our primary paper. The reproducibility protocol is created in Docker and tested in Windows and Linux. In brief, our primary work (i) develops a method for generating effective prototypes, as templates or logical sequences of pre-processing transformations, and (ii) instantiates the prototypes into pipelines, in the form of executable or physical sequences of actual operators that implement the respective transformations. For the first, a set of heuristic rules learned from extensive experiments are used, and for the second techniques from Automated Machine Learning (AutoML) are applied., This work is partially supported by the EU’s Horizon Programme call, under Grant Agreements No. 101093164 (ExtremeXP) and the DOGO4ML project, funded by the Spanish Ministerio de Ciencia e Innovación under the project/funding scheme PID2020-117191RB-I00 / AEI / 10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Gestió de dades massives

  • Abelló Gamazo, Alberto
  • Bilalli, Besim
Aquest article pretén donar una visió general del que és la gestió de dades massives, la seva problemàtica i com s’han d’abordar les solucions. La principal dificultat és que no existeix una solució genèrica i s’ha de construir a mida de cada organització., Aquest treball està parcialment finançat per la Comissió Europea sota l’acord 101093164, corresponent al projecte ExtremeXP., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Improving continual knowledge graph embedding via informed initialization

  • Pons Recasens, Gerard
  • Bilalli, Besim
  • Queralt Calafat, Anna
Knowledge Graphs (KGs) represent knowledge as structured graphs of entities and their relationships. Knowledge Graph Embeddings (KGEs) enable learning and inference over KGs by representing their entities and relations as continuous vectors. Many KGs are frequently updated, requiring their KGEs to adapt to these changes. Continual learning methods for KGEs address this by incorporating new embeddings while updating existing ones to account for the new facts without retraining from scratch. A necessary step in these methods is the initialization of new embeddings, which has an important impact both on the accuracy of the resulting embeddings, and in the time required for their training. Current continual learning methods either use a random initialization as in non-continual scenarios, ignoring relevant information in existing embeddings, or rely on a model-dependent initialization, which is only compatible with specific KGE training models. We propose a novel informed embedding initialization strategy that can be seamlessly integrated into existing continual learning methods for KGEs. Our approach leverages the KG schema along with previously learned embeddings to generate semantically informed initial representations at every continual learning step, enhancing knowledge acquisition while reducing catastrophic forgetting in the final embeddings obtained. Experimental results show that our strategy improves the predictive performance of the resulting KGEs and enhances knowledge retention. Moreover, it accelerates the learning process, reducing the number of epochs, and thus the time required to incrementally learn new embeddings. Finally, our evaluation demonstrates that these benefits are consistent regardless of the KGE learning model used., This work is supported by the Horizon Europe Programme under GA.101093164 (ExtremeXP) and the Spanish Ministerio de Ciencia e Innovación under project PID2023-152841OA-I00/ AEI/10.13039/501100011033 (TALC)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Capturing and anticipating user intents in data analytics via knowledge graphs

  • Pons Recasens, Gerard
  • Bilalli, Besim
  • Queralt Calafat, Anna
In today’s data-driven world, the ability to extract meaningful information from data is becoming essential for businesses, organizations and researchers. For this purpose, a wide range of tools and systems exists addressing data-related tasks, from data integration, preprocessing and modeling, to the interpretation and evaluation of the results. As data continues to grow in volume and complexity, there is an increasing need for advanced yet user-friendly tools, such as intelligent discovery assistants (IDAs) or automated machine learning (AutoML) systems, that facilitate the user’s interaction with data. This enables non-expert users to effectively leverage powerful data analytics techniques. However, the use of these tools still requires non-trivial user input that cannot be anticipated from the analytical problem’s data alone, but must be tailored to each individual user and their specific intents. To this end, this work explores the use of Knowledge Graphs (KG) as a foundational representation for capturing complex analytics workflows, as well as information about the users, their intents and their feedback, in order to facilitate user interaction with IDAs or AutoML tools. This is achieved through established techniques from recommender systems, in particular a link prediction approach based on KG embeddings and graph neural networks. Experimental results show that the proposed method effectively captures the graph structure and produces meaningful suggestions for users. To demonstrate the feasibility of the approach, a working prototype is presented., This work is supported by the Horizon Europe Programme under GA.101093164 (ExtremeXP) and the Spanish Ministerio de Ciencia e Innovación under project PID2023-152841OAI00/AEI/10.13039/501100011033 (TALC)., Peer Reviewed, Postprint (published version)