This slideshow is about the time series classifier algorithm, ShiftTree.
ShiftTree is a unique, model-based approach for time series classification. The basic idea is that we assign a cursor (or eye) to each series and move this to certain positions on the time axis. We generate dynamic attributes by answering two questions: (1) Where to look? (2) What to look at?. The answer to the first question tells us where to move the cursor (e.g.: forward 100 steps, to the previous local maxima, etc), while the second answer defines the calculation of the dynamic attributes (e.g.: value at that point, the weighted avarage of the values around the position, the difference in the current and previous cursor position, etc). These dynamic attributes then used in a binary decision tree.
This slideshow was originally presented at ECML/PKDD 2011 in Athens.
Note that for whatever reasons SlideShare doesn't support animations. Therefore the animated slides were split into multiple slides.
Slides presented at ALT-C 2016; updated after the presentation.
What can we learn from learning analytics? A case study based on an analysis of student use of video recordings [paper 1247]. Moira Sarsfield, and John Conway
The document discusses Ramirent's financial results and operations. It states that net sales increased 2.5% in comparable currencies but EBITA margin was lower than in 2015. It also notes that profitability development did not reach its potential in Q3 and they will now focus on short-term performance improvements and turnarounds in parts of the business where profitability is insufficient.
El skateboarding es un deporte que consiste en deslizarse sobre una tabla con ruedas y realizar trucos elevando la tabla del suelo y haciendo figuras en el aire. Se practica con una tabla de madera plana con ruedas y rodillos. Algunos trucos básicos incluyen el ollie, que es elevar la tabla del suelo y la base de casi todos los demás trucos, el nollie que es similar al ollie pero más difícil, y el kickflip que involucra hacer que la tabla de un giro completo.
El documento describe las diferentes medidas de coerción que pueden imponerse a una persona durante un proceso penal en la República Dominicana. Estas incluyen citación, arresto, prisión preventiva, arresto domiciliario, prohibición de salir del país, presentación periódica ante autoridades, y garantía económica. La prisión preventiva solo debe usarse cuando no haya otras medidas que eviten el riesgo de fuga. Para los menores de edad, las medidas buscan garantizar su presencia en el proceso y incluyen cambio de residencia y detención provisional
Slides presented at ALT-C 2016; updated after the presentation.
What can we learn from learning analytics? A case study based on an analysis of student use of video recordings [paper 1247]. Moira Sarsfield, and John Conway
The document discusses Ramirent's financial results and operations. It states that net sales increased 2.5% in comparable currencies but EBITA margin was lower than in 2015. It also notes that profitability development did not reach its potential in Q3 and they will now focus on short-term performance improvements and turnarounds in parts of the business where profitability is insufficient.
El skateboarding es un deporte que consiste en deslizarse sobre una tabla con ruedas y realizar trucos elevando la tabla del suelo y haciendo figuras en el aire. Se practica con una tabla de madera plana con ruedas y rodillos. Algunos trucos básicos incluyen el ollie, que es elevar la tabla del suelo y la base de casi todos los demás trucos, el nollie que es similar al ollie pero más difícil, y el kickflip que involucra hacer que la tabla de un giro completo.
El documento describe las diferentes medidas de coerción que pueden imponerse a una persona durante un proceso penal en la República Dominicana. Estas incluyen citación, arresto, prisión preventiva, arresto domiciliario, prohibición de salir del país, presentación periódica ante autoridades, y garantía económica. La prisión preventiva solo debe usarse cuando no haya otras medidas que eviten el riesgo de fuga. Para los menores de edad, las medidas buscan garantizar su presencia en el proceso y incluyen cambio de residencia y detención provisional
This document introduces Dr. Martin Ebner and Mohammad Khalil, who work in the department of Social Learning at Graz University of Technology. Their areas of focus are learning analytics, MOOCs, and mobile learning. The document then discusses the concept of learning analytics, highlighting the importance of transparency, identification, ownership, accuracy, and security of student data. It also addresses the challenges of ensuring privacy through de-identification of data, which must be done formally according to various standards and regulations. While progress has been made, de-identification may still not be perfect.
El documento describe las teorías de la personalidad y la teoría psicoanalítica de Sigmund Freud. Freud creía que la personalidad está compuesta de tres partes - el Ello, Yo y Superyó - y que la infancia es crucial para el desarrollo de la personalidad a través de etapas psicosexuales. La terapia psicoanalítica se basa en la asociación libre para ayudar a los pacientes a liberarse de recuerdos dolorosos inconscientes de la infancia. El documento también resume brevemente otras teorías importantes como las te
This document discusses drilling machines and drilling operations. It describes different types of drilling machines including bench drilling machines, radial drilling machines, and upright drilling machines. It also covers drilling tools and operations such as reaming, boring, counterboring, countersinking, spot facing and tapping. Safety precautions for operating drilling machines and definitions of cutting speed, feed rate, and depth of cut are provided.
Truskavets is a picturesque resort town in southeastern Ukraine known for its mineral springs and forests. It has a 9-story hotel with 452 rooms connected by galleries to a club, dining hall, and sports and wellness complex. In the 1920s-1930s, Truskavets became one of Europe's leading "water" resorts along with places like Vichy, France and Karlovy Vary, Czech Republic. The town is home to mineral springs believed to help conditions like kidney disease and gout. Nearby are sources of other healing waters and scenic nature areas within a 50km radius. An old defensive structure called "Kotochy Castle" is a popular tourist spot surrounded
The drilling machine or drill press is one of the most common and useful machine employed in industry for producing forming and finishing holes in a workpiece.
Egyedi termék kreatívok tömeges gyártása generatív AI segítségévelBalázs Hidasi
UPDATE: Typo on the 8th slide, last line should be (slides can't be modified on slideshare):
grad(log(p_gamma(x|y))) = (1-gamma)*grad(log(p(x))) + gamma*grad(log(p(x|y)))
My presentation on using generative AI for creative generation for e-commerce. Presented on 14 November 2023 at the TECH meetup series organized by Gravity R&D, a Taboola company. Slides are in Hungarian.
*****
Title/abstract in English:
Mass production of unique product creatives with generative AI
-----
The probability of a user clicking on an online advertisement is greatly influenced by creative's look. Traditional brand level campaigns require only a few creatives that can be produced by humans. However product level recommendations require creatives for every single product. Producing these using human work is infeasible at scale, thus they are often shown in front of simple (e.g. white) backgrounds. This presentation showcases a solution based on generative AI that allows placing products in different environments, which makes the creatives more appealing. I'll talk about the challenges of this approach along with potential solutions, as well as the initial results of our live test.
*****
Eredeti absztrakt:
Az online hirdetések megjelenése nagyban befolyásolja a rákattintás valószínűségét. A tradicionális márka szinten targetált kampányokhoz szükséges egy-két kreatív/banner legyártása még emberi erőforrás igénybevételével is megoldható. Termék szintű ajánlás esetén viszont minden egyes termékhez külön kreatívra van szükség, akár több felbontásban. Nagyszámú kreatív legyártása emberi erővel lassú és drága, ezért gyakori megközelítés a terméket valamilyen egyszerű, például egyszínű, háttér előtt megjeleníteni. Az előadás során bemutatunk egy generatív AI technológián alapuló megoldást, ami lehetővé teszi, hogy a termékeket különféle környezetekben jelenítsük meg, és így érdekesebbé/vonzóbbá tegyük a kreatívokat. Szót ejtünk a megközelítés nehézségeiről, lehetséges megoldásokról, és a módszer hatékonyságát vizsgáló mérésünk előzetes eredményeiről.
The Effect of Third Party Implementations on ReproducibilityBalázs Hidasi
This document examines the reproducibility of implementations of the GRU4Rec recommender algorithm. It analyzes several reimplementations of GRU4Rec in PyTorch, TensorFlow, Keras and benchmarking frameworks. It finds that while some reimplementations capture the overall architecture, they are missing features and hyperparameters described in the original papers. Some implementations also contain errors in their implementation. Offline experiments show performance degradations in the reimplementations compared to the original implementation, with median total performance losses ranging from 7-99% depending on the reimplementation and dataset. Training time comparisons show that versions with missing features require less time to train than a feature-complete version.
GRU4Rec v2 - Recurrent Neural Networks with Top-k Gains for Session-based Rec...Balázs Hidasi
Slides of my presentation at CIKM2018 about version 2 of the GRU4Rec algorithm, a recurrent neural network based algorithm for the session-based recommendation task.
We discuss sampling strategies and introduce additional sampling to the algorithm. We also redesign the loss function to cope with additional sampling. The resulting BPR-max loss function is able to efficiently handle many negative samples without encountering the vanishing gradient problem. We also introduce constrained embeddings which speeds up the conversion of item representations and reduces memory usage by a factor of 4. These improvements increase offline measures up to 52%.
In the talk we also discuss online A/B test and the implications of long time observations. Most of these observations are exclusive to this talk and are not in the paper.
You can access the preprint version of the paper on arXiv: https://arxiv.org/abs/1706.03847
The code is available on GitHub: https://github.com/hidasib/GRU4Rec
Deep Learning in Recommender Systems - RecSys Summer School 2017Balázs Hidasi
This is the presentation accompanying my tutorial about deep learning methods in the recommender systems domain. The tutorial consists of a brief general overview of deep learning and the introduction of the four most prominent research direction of DL in recsys as of 2017. Presented during RecSys Summer School 2017 in Bolzano, Italy.
Parallel Recurrent Neural Network Architectures for Feature-rich Session-base...Balázs Hidasi
Slides for my RecSys 2016 talk on integrating image and textual information into session based recommendations using novel parallel RNN architectures.
Link to the paper: http://www.hidasi.eu/en/publications.html#p_rnn_recsys16
Context aware factorization methods for implicit feedback based recommendatio...Balázs Hidasi
Slides I prepared for defending my PhD dissertation on context-aware factorization methods for implicit-feedback based recommendations. Dissertation (in English) can be accessed here: http://hidasi.eu/content/phd.pdf Slides are in Hungarian.
Deep learning to the rescue - solving long standing problems of recommender ...Balázs Hidasi
I gave this talk at the 1st Budapest RecSys and Personalization Meetup about using deep learning to solve long standing problems of recommender systems. I also presented our approach on using RNNs for session-based recommendations in details.
Deep learning: the future of recommendationsBalázs Hidasi
An informative talk about deep learning and its potential uses in recommender systems. Presented at the Budapest Startup Safary, 21 April, 2016.
The breakthroughs of the last decade in neural network research and the quick increasing of computational power resulted in the revival of deep neural networks and the field focusing on their training: deep learning. Deep learning methods have succeeded in complex tasks where other machine learning methods have failed, such as computer vision and natural language processing. Recently deep learning has began to gain ground in recommender systems as well. This talk introduces deep learning and its applications, with emphasis on how deep learning methods can solve long standing recommendation problems.
Context-aware preference modeling with factorizationBalázs Hidasi
- The document outlines Balázs Hidasi's research on context-aware recommendation models using factorization techniques.
- It introduces context-aware algorithms like iTALS and iTALSx that estimate preferences using ALS learning and scale linearly with data.
- Methods for speeding up ALS through approximate solutions like ALS-CG and ALS-CD are described, providing significant speed gains.
- A General Factorization Framework (GFF) is presented that allows experimenting with novel context-aware preference models beyond traditional approaches.
Approximate modeling of continuous context in factorization algorithms (CaRR1...Balázs Hidasi
This document proposes two approaches to approximately model continuous context in factorization recommendation algorithms: 1) Fuzzy event modeling which associates events near context boundaries with multiple contexts and 2) Fuzzy context modeling which uses overlapping context states and mixtures of their features. It shows fuzzy context modeling improved recommendation accuracy in implicit feedback datasets by 3-500% when applied to seasonality context in an iTALS algorithm. Future work could apply the approaches to other algorithms and address modeling context as truly continuous.
Utilizing additional information in factorization methods (research overview,...Balázs Hidasi
Utilizing additional information in factorization methods is an overview of research into context-aware recommender systems using factorization models. It discusses improving factorization methods from early context-aware tensor models like iTALS and iTALSx to a general factorization framework. The research aims to better model implicit feedback, context, and improve scalability using techniques like conjugate gradient descent learning. Future work includes estimating the utility of context dimensions, modeling continuous context variables, and optimizing models with pairwise ranking loss functions.
Az implicit ajánlási probléma és néhány megoldása (BME TMIT szeminárium előad...Balázs Hidasi
Ez a diasor egy ismeretterjesztő előadáshoz készült.
Az előadás témája az implicit feedback alapú ajánlás (amikor a felhasználók preferenciái nem olvashatóak ki közvetlenül az adatokból), és a probléma néhány lehetséges megoldása. A prezentáció a probléma ismertetését követően kitér néhány kutatási eredményemre, mint például a mátrix faktorizáció inicializálására, vagy az implicit tenzorfaktorizációra.
Az előadásra 2012. nyarán, a BME Távközlési és Médiainformatikai Tanszéke (TMIT) által szervezett szemináriumon került sor.
Context-aware similarities within the factorization framework (CaRR 2013 pres...Balázs Hidasi
This document summarizes research on incorporating context awareness into item-to-item recommendation similarities within a factorization framework. It describes four levels of context-aware similarity calculation and reports on experiments comparing the levels using four datasets. The results showed that context awareness generally improved recommendations but the degree of improvement depended heavily on the method and quality of the contextual information. The most context-sensitive method (elementwise product level 2) showed huge improvements or decreases depending on the context, while other methods showed only minor gains. Future work could explore different contexts, similarity measures, and evaluation approaches.
iTALS: implicit tensor factorization for context-aware recommendations (ECML/...Balázs Hidasi
This presentation is about the context-aware recommender algorithm iTALS.
iTALS is a context-aware recommender algorithm for implicit feedback data. The user-item-context(s) setup is modelled in a binary tensor. Weights are also assigned to the cells based on the certainity of their information. An ALS-based algorithm is proposed that is capable of efficiently factorizing this tensor. Additionally a novel context information is introduced: sequentiality. This context allows us to incorporate association rule like information into the factorization framework and to differentiate between items with different repetetiveness patters and thus to make recommendations more accurate.
This presentation was originally given at ECML/PKDD 2012 in Bristol.
Initialization of matrix factorization (CaRR 2012 presentation)Balázs Hidasi
This presentation is about why initialization of matrix factorization methods is important and proposes an interesting initialization method (coined SimFactor). The method revolves around a similarity preserving dimensionality reduction technique. Context-based initialization is introduced as well.
As most of my recommender systems related research, this presentation focuses on implicit feedback (the case where user preferences are not coded explicitely in the data).
Originally presented at the 2nd workshop on Context-awareness in Retrieval and Recommendations (CaRR 2012) in Lisbon.
ShiftTree: model alapú idősor-osztályozó (VK 2009 előadás)Balázs Hidasi
A prezentáció témája a ShiftTree névre hallgató, egyedi, model alapú idősor-osztályozó.
A ShiftTree az idősor-osztályozás problémájának egy egyedülálló, modell alapú megközelítése. Az elképzelés alapja, hogy minden idősorhoz egy szemet (kurzort) rendelünk, ami az időtengely egy adott pontjára mutat. Dinamikus attribútumokat hozunk létre úgy, hogy a következő két kérdésre válaszolunk: (1) Hová nézzünk az időtengelyen? (2) Mit nézzünk az adott pontban? Az első kérdésre adott válasz azt mondja meg, hogy hogyan mozgassuk a szemet az időtengely mentén. A második válasz pedig azt definiálja, hogy hogyan számoljuk ki a dinamikus attribútum értékét az adott pontban. Ezeket a dinamikus attribútumokat ezután egy bináris döntési fában használjuk fel.
Ez a diasor a ShiftTree egy korai (2009-es) verzióját mutatja be.
A prezentáció a 2009-es Végzős Konferencián került bemutatásra.
Megjegyzés: valamilyen oknál fogva a SlideShare nem támogatja az animációkat, ezért az animált diák több diára lettek szétszedve.
This document introduces Dr. Martin Ebner and Mohammad Khalil, who work in the department of Social Learning at Graz University of Technology. Their areas of focus are learning analytics, MOOCs, and mobile learning. The document then discusses the concept of learning analytics, highlighting the importance of transparency, identification, ownership, accuracy, and security of student data. It also addresses the challenges of ensuring privacy through de-identification of data, which must be done formally according to various standards and regulations. While progress has been made, de-identification may still not be perfect.
El documento describe las teorías de la personalidad y la teoría psicoanalítica de Sigmund Freud. Freud creía que la personalidad está compuesta de tres partes - el Ello, Yo y Superyó - y que la infancia es crucial para el desarrollo de la personalidad a través de etapas psicosexuales. La terapia psicoanalítica se basa en la asociación libre para ayudar a los pacientes a liberarse de recuerdos dolorosos inconscientes de la infancia. El documento también resume brevemente otras teorías importantes como las te
This document discusses drilling machines and drilling operations. It describes different types of drilling machines including bench drilling machines, radial drilling machines, and upright drilling machines. It also covers drilling tools and operations such as reaming, boring, counterboring, countersinking, spot facing and tapping. Safety precautions for operating drilling machines and definitions of cutting speed, feed rate, and depth of cut are provided.
Truskavets is a picturesque resort town in southeastern Ukraine known for its mineral springs and forests. It has a 9-story hotel with 452 rooms connected by galleries to a club, dining hall, and sports and wellness complex. In the 1920s-1930s, Truskavets became one of Europe's leading "water" resorts along with places like Vichy, France and Karlovy Vary, Czech Republic. The town is home to mineral springs believed to help conditions like kidney disease and gout. Nearby are sources of other healing waters and scenic nature areas within a 50km radius. An old defensive structure called "Kotochy Castle" is a popular tourist spot surrounded
The drilling machine or drill press is one of the most common and useful machine employed in industry for producing forming and finishing holes in a workpiece.
Egyedi termék kreatívok tömeges gyártása generatív AI segítségévelBalázs Hidasi
UPDATE: Typo on the 8th slide, last line should be (slides can't be modified on slideshare):
grad(log(p_gamma(x|y))) = (1-gamma)*grad(log(p(x))) + gamma*grad(log(p(x|y)))
My presentation on using generative AI for creative generation for e-commerce. Presented on 14 November 2023 at the TECH meetup series organized by Gravity R&D, a Taboola company. Slides are in Hungarian.
*****
Title/abstract in English:
Mass production of unique product creatives with generative AI
-----
The probability of a user clicking on an online advertisement is greatly influenced by creative's look. Traditional brand level campaigns require only a few creatives that can be produced by humans. However product level recommendations require creatives for every single product. Producing these using human work is infeasible at scale, thus they are often shown in front of simple (e.g. white) backgrounds. This presentation showcases a solution based on generative AI that allows placing products in different environments, which makes the creatives more appealing. I'll talk about the challenges of this approach along with potential solutions, as well as the initial results of our live test.
*****
Eredeti absztrakt:
Az online hirdetések megjelenése nagyban befolyásolja a rákattintás valószínűségét. A tradicionális márka szinten targetált kampányokhoz szükséges egy-két kreatív/banner legyártása még emberi erőforrás igénybevételével is megoldható. Termék szintű ajánlás esetén viszont minden egyes termékhez külön kreatívra van szükség, akár több felbontásban. Nagyszámú kreatív legyártása emberi erővel lassú és drága, ezért gyakori megközelítés a terméket valamilyen egyszerű, például egyszínű, háttér előtt megjeleníteni. Az előadás során bemutatunk egy generatív AI technológián alapuló megoldást, ami lehetővé teszi, hogy a termékeket különféle környezetekben jelenítsük meg, és így érdekesebbé/vonzóbbá tegyük a kreatívokat. Szót ejtünk a megközelítés nehézségeiről, lehetséges megoldásokról, és a módszer hatékonyságát vizsgáló mérésünk előzetes eredményeiről.
The Effect of Third Party Implementations on ReproducibilityBalázs Hidasi
This document examines the reproducibility of implementations of the GRU4Rec recommender algorithm. It analyzes several reimplementations of GRU4Rec in PyTorch, TensorFlow, Keras and benchmarking frameworks. It finds that while some reimplementations capture the overall architecture, they are missing features and hyperparameters described in the original papers. Some implementations also contain errors in their implementation. Offline experiments show performance degradations in the reimplementations compared to the original implementation, with median total performance losses ranging from 7-99% depending on the reimplementation and dataset. Training time comparisons show that versions with missing features require less time to train than a feature-complete version.
GRU4Rec v2 - Recurrent Neural Networks with Top-k Gains for Session-based Rec...Balázs Hidasi
Slides of my presentation at CIKM2018 about version 2 of the GRU4Rec algorithm, a recurrent neural network based algorithm for the session-based recommendation task.
We discuss sampling strategies and introduce additional sampling to the algorithm. We also redesign the loss function to cope with additional sampling. The resulting BPR-max loss function is able to efficiently handle many negative samples without encountering the vanishing gradient problem. We also introduce constrained embeddings which speeds up the conversion of item representations and reduces memory usage by a factor of 4. These improvements increase offline measures up to 52%.
In the talk we also discuss online A/B test and the implications of long time observations. Most of these observations are exclusive to this talk and are not in the paper.
You can access the preprint version of the paper on arXiv: https://arxiv.org/abs/1706.03847
The code is available on GitHub: https://github.com/hidasib/GRU4Rec
Deep Learning in Recommender Systems - RecSys Summer School 2017Balázs Hidasi
This is the presentation accompanying my tutorial about deep learning methods in the recommender systems domain. The tutorial consists of a brief general overview of deep learning and the introduction of the four most prominent research direction of DL in recsys as of 2017. Presented during RecSys Summer School 2017 in Bolzano, Italy.
Parallel Recurrent Neural Network Architectures for Feature-rich Session-base...Balázs Hidasi
Slides for my RecSys 2016 talk on integrating image and textual information into session based recommendations using novel parallel RNN architectures.
Link to the paper: http://www.hidasi.eu/en/publications.html#p_rnn_recsys16
Context aware factorization methods for implicit feedback based recommendatio...Balázs Hidasi
Slides I prepared for defending my PhD dissertation on context-aware factorization methods for implicit-feedback based recommendations. Dissertation (in English) can be accessed here: http://hidasi.eu/content/phd.pdf Slides are in Hungarian.
Deep learning to the rescue - solving long standing problems of recommender ...Balázs Hidasi
I gave this talk at the 1st Budapest RecSys and Personalization Meetup about using deep learning to solve long standing problems of recommender systems. I also presented our approach on using RNNs for session-based recommendations in details.
Deep learning: the future of recommendationsBalázs Hidasi
An informative talk about deep learning and its potential uses in recommender systems. Presented at the Budapest Startup Safary, 21 April, 2016.
The breakthroughs of the last decade in neural network research and the quick increasing of computational power resulted in the revival of deep neural networks and the field focusing on their training: deep learning. Deep learning methods have succeeded in complex tasks where other machine learning methods have failed, such as computer vision and natural language processing. Recently deep learning has began to gain ground in recommender systems as well. This talk introduces deep learning and its applications, with emphasis on how deep learning methods can solve long standing recommendation problems.
Context-aware preference modeling with factorizationBalázs Hidasi
- The document outlines Balázs Hidasi's research on context-aware recommendation models using factorization techniques.
- It introduces context-aware algorithms like iTALS and iTALSx that estimate preferences using ALS learning and scale linearly with data.
- Methods for speeding up ALS through approximate solutions like ALS-CG and ALS-CD are described, providing significant speed gains.
- A General Factorization Framework (GFF) is presented that allows experimenting with novel context-aware preference models beyond traditional approaches.
Approximate modeling of continuous context in factorization algorithms (CaRR1...Balázs Hidasi
This document proposes two approaches to approximately model continuous context in factorization recommendation algorithms: 1) Fuzzy event modeling which associates events near context boundaries with multiple contexts and 2) Fuzzy context modeling which uses overlapping context states and mixtures of their features. It shows fuzzy context modeling improved recommendation accuracy in implicit feedback datasets by 3-500% when applied to seasonality context in an iTALS algorithm. Future work could apply the approaches to other algorithms and address modeling context as truly continuous.
Utilizing additional information in factorization methods (research overview,...Balázs Hidasi
Utilizing additional information in factorization methods is an overview of research into context-aware recommender systems using factorization models. It discusses improving factorization methods from early context-aware tensor models like iTALS and iTALSx to a general factorization framework. The research aims to better model implicit feedback, context, and improve scalability using techniques like conjugate gradient descent learning. Future work includes estimating the utility of context dimensions, modeling continuous context variables, and optimizing models with pairwise ranking loss functions.
Az implicit ajánlási probléma és néhány megoldása (BME TMIT szeminárium előad...Balázs Hidasi
Ez a diasor egy ismeretterjesztő előadáshoz készült.
Az előadás témája az implicit feedback alapú ajánlás (amikor a felhasználók preferenciái nem olvashatóak ki közvetlenül az adatokból), és a probléma néhány lehetséges megoldása. A prezentáció a probléma ismertetését követően kitér néhány kutatási eredményemre, mint például a mátrix faktorizáció inicializálására, vagy az implicit tenzorfaktorizációra.
Az előadásra 2012. nyarán, a BME Távközlési és Médiainformatikai Tanszéke (TMIT) által szervezett szemináriumon került sor.
Context-aware similarities within the factorization framework (CaRR 2013 pres...Balázs Hidasi
This document summarizes research on incorporating context awareness into item-to-item recommendation similarities within a factorization framework. It describes four levels of context-aware similarity calculation and reports on experiments comparing the levels using four datasets. The results showed that context awareness generally improved recommendations but the degree of improvement depended heavily on the method and quality of the contextual information. The most context-sensitive method (elementwise product level 2) showed huge improvements or decreases depending on the context, while other methods showed only minor gains. Future work could explore different contexts, similarity measures, and evaluation approaches.
iTALS: implicit tensor factorization for context-aware recommendations (ECML/...Balázs Hidasi
This presentation is about the context-aware recommender algorithm iTALS.
iTALS is a context-aware recommender algorithm for implicit feedback data. The user-item-context(s) setup is modelled in a binary tensor. Weights are also assigned to the cells based on the certainity of their information. An ALS-based algorithm is proposed that is capable of efficiently factorizing this tensor. Additionally a novel context information is introduced: sequentiality. This context allows us to incorporate association rule like information into the factorization framework and to differentiate between items with different repetetiveness patters and thus to make recommendations more accurate.
This presentation was originally given at ECML/PKDD 2012 in Bristol.
Initialization of matrix factorization (CaRR 2012 presentation)Balázs Hidasi
This presentation is about why initialization of matrix factorization methods is important and proposes an interesting initialization method (coined SimFactor). The method revolves around a similarity preserving dimensionality reduction technique. Context-based initialization is introduced as well.
As most of my recommender systems related research, this presentation focuses on implicit feedback (the case where user preferences are not coded explicitely in the data).
Originally presented at the 2nd workshop on Context-awareness in Retrieval and Recommendations (CaRR 2012) in Lisbon.
ShiftTree: model alapú idősor-osztályozó (VK 2009 előadás)Balázs Hidasi
A prezentáció témája a ShiftTree névre hallgató, egyedi, model alapú idősor-osztályozó.
A ShiftTree az idősor-osztályozás problémájának egy egyedülálló, modell alapú megközelítése. Az elképzelés alapja, hogy minden idősorhoz egy szemet (kurzort) rendelünk, ami az időtengely egy adott pontjára mutat. Dinamikus attribútumokat hozunk létre úgy, hogy a következő két kérdésre válaszolunk: (1) Hová nézzünk az időtengelyen? (2) Mit nézzünk az adott pontban? Az első kérdésre adott válasz azt mondja meg, hogy hogyan mozgassuk a szemet az időtengely mentén. A második válasz pedig azt definiálja, hogy hogyan számoljuk ki a dinamikus attribútum értékét az adott pontban. Ezeket a dinamikus attribútumokat ezután egy bináris döntési fában használjuk fel.
Ez a diasor a ShiftTree egy korai (2009-es) verzióját mutatja be.
A prezentáció a 2009-es Végzős Konferencián került bemutatásra.
Megjegyzés: valamilyen oknál fogva a SlideShare nem támogatja az animációkat, ezért az animált diák több diára lettek szétszedve.
ShiftTree: model alapú idősor-osztályozó (ML@BP előadás, 2012)Balázs Hidasi
A prezentáció témája a ShiftTree névre hallgató, egyedi, model alapú idősor-osztályozó.
A ShiftTree az idősor-osztályozás problémájának egy egyedülálló, modell alapú megközelítése. Az elképzelés alapja, hogy minden idősorhoz egy szemet (kurzort) rendelünk, ami az időtengely egy adott pontjára mutat. Dinamikus attribútumokat hozunk létre úgy, hogy a következő két kérdésre válaszolunk: (1) Hová nézzünk az időtengelyen? (2) Mit nézzünk az adott pontban? Az első kérdésre adott válasz azt mondja meg, hogy hogyan mozgassuk a szemet az időtengely mentén. A második válasz pedig azt definiálja, hogy hogyan számoljuk ki a dinamikus attribútum értékét az adott pontban. Ezeket a dinamikus attribútumokat ezután egy bináris döntési fában használjuk fel.
Ez a diasor a legteljesebb, a ShiftTree-ről szóló prezentációk közül. Tartalmaz több kiegészítést, valamint leír néhány olyan megoldást, amik a kutatás során előkerültek, de végül zsákutcának bizonyultak.
A prezentáció egy 2012. februári előadáshoz tartozik, amire az ML@BP rendezvénysorozat keretein belül került sor.
Megjegyzés: valamilyen oknál fogva a SlideShare nem támogatja az animációkat, ezért az animált diák több diára lettek szétszedve.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Project Management Semester Long Project - Acuityjpupo2018
Acuity is an innovative learning app designed to transform the way you engage with knowledge. Powered by AI technology, Acuity takes complex topics and distills them into concise, interactive summaries that are easy to read & understand. Whether you're exploring the depths of quantum mechanics or seeking insight into historical events, Acuity provides the key information you need without the burden of lengthy texts.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
ShiftTree: model based time series classifier (ECML/PKDD 2011 presentation)
1. SHIFTTREE:
AN INTERPRETABLE MODEL-BASED APPROACH FOR
TIME SERIES CLASSIFICATION
Balázs Hidasi - hidasi@tmit.bme.hu
Csaba Gáspár-Papanek - gaspar@tmit.bme.hu
Budapest University of Technology and Economics,
Hungary
ECML/PKDD, 6TH SEPTEMBER 2011, ATHENS
3. GENERAL CONCEPT
Not limited to time series
Time series
Semi-structured data
Graphs
Two questions:
„Where to look at?”
„What to observe?”
Operator families
EyeShifter Operator(s) (ESO)
F(x)
ConditionBuilder Operators (CBO)
Dynamic attributes
Model: sequence of simple operatos / rules 3/17
4. TIME SERIES CLASSIFICATION
Time series Learning
Model
With one observed variable
Evenly sampled
The algorithm has no such limitations
Standard classification task
Focusing on accuracy Model
Labeling
Goals
Satisfying accuracy
Model-based instead of memory-based
4/17
Interpretable models
5. EXPLAINING THE GOALS
Why model-based?
Labeling is much faster
Can learn more general properties of the classes
Needs more training samples
What is interpretability good for?
Getting user trust
Helping in understanding the data
5/17
6. CONCEPT APPLIED TO TIME SERIES
Dynamic attributes of time series
EyeShifter Operator (ESO): „Where to look at?”
Moves a cursor along the time axis
To a specified point of the series
E.g.: „To the next local minimum”, „100 steps ahead”, etc.
Note: result of operator sequence depens on the order
ConditionBuilder Operator (CBO): „What to observe?”
F(x)
Computes the dynamic attribute
E.g.: „Value at the given time”, „Length of the jump”, etc.
Decision tree as model Weighted average
Works well with the dynamic attribute concept 6/17
Operator sequence from root to leaf
7. LABELING
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
8. LABELING
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
9. LABELING
Dynamic attribute value: 0,836848
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
10. LABELING
Dynamic attribute value: 0,836848
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
11. LABELING
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
12. LABELING
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
13. LABELING
Dynamic attribute value: 0,767139
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
14. LABELING
Dynamic attribute value: 0,767139
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
15. LABELING
Level 0
ESO: To global max
CBO: Value at time
Threshold: 1,20775
Level 1 Level 1
ESO: Step forward 100 ESO: To next local max
CBO: Value at time CBO: Value at time
Threshold : 0,390093 Threshold : -0,700739
Level 2 Level 2 Level 2 Level 2
7/17
Leaf Leaf Leaf Leaf
16. LEARNING (1/3)
Operator pool definition: ESOs, CBOs
Root node
Cursor starts at the beginning
May be overridden
8/17
18. LEARNING (3/3)
Best split selected
Cursor is moved by ESO
Reachable positions will change
Train set split
Child nodes continue the learning
process
Stop: homogenous nodes
10/17
19. INTERPRETABILITY
Depends on the operators
Helps undepstanding the data
E.g.: CBF dataset
Z-normalized, 3 class: Cylinder, Bell, Funnel
Distinguish cylinder from bell and funnel by global maxima
The data is z-normalized (standardized)
Distinguish bell from funnel by stepping back 25 steps + noise 11/17
filtering through weighted average
On which side is the peak
20. PERFORMANCE OF THE ALGORITHM
Databases
UCR: mostly smaller data sets (20)
Ford: larger data sets (2)
No optimizations in the experiments
Performance
Better on larger data sets (model-based)
100.00% 94.97% 96.52%
92.94%
90.00%
81.29% 83.19%
80.00% 74.67% 73.33%
69.11%
70.00% 64.93%
60.00%
50.00%
40.00%
30.00%
20.00%
10.00%
12/17
0.00%
Smaller UCR sets (15) Larger UCR sets (5) Ford (largest) sets (2)
1NN Eucledian 1NN DTW ShiftTree
21. ADVANTAGES AND DRAWBACKS
Advantages
Advantages of being model based (fast labeling, etc)
Interpretable (depens on operators)
Can be used independently of application domain
Expert’s knowledge can be built in through operators
Disadvantages
Optimization of the operators is not trivial
Learning may take a long time when too many
operators used
Disadvantages of the model based methods (larger
training set required, etc) 13/17
22. SHIFTFOREST: COMBINING MULTIPLE MODELS
Combining models enhances accuracy
Boosting
Some issues on smaller datasets
The „XV” method
Splitting training set (random splits)
Building model on the first part, evaluating on the
second
Model weight: the measured accuracy
14/17
23. SHIFTFOREST RESULTS
Accuracy increases
Interpretability is often lost
May the intersection of the trees can be interpreted
100.00% 96.52%97.77%
92.94%94.97%
88.87%
90.00% 85.93%
81.29% 83.19%
80.00% 74.67% 73.33%
69.11%
70.00% 64.93%
60.00%
50.00%
40.00%
30.00%
20.00%
10.00%
0.00%
Smaller UCR sets (15) Larger UCR sets (5) Ford (largest) sets (2)
15/17
1NN Eucledian 1NN DTW ShiftTree ShiftForest
24. CONCLUSION
Novel model-based algorithm
Uses cursors and operators
Cursor movement
Attribute computation
Sequence of simple operators as the model
Decision tree
Base of a whole algorithm family
16/17
25. THANK YOU FOR YOUR ATTENTION!
Balázs Hidasi Csaba Gáspár-Papanek
(hidasi@tmit.bme.hu) (gaspar@tmit.bme.hu)
17/17
For more ShiftTree related research visit my side: http://www.hidasi.eu
26. TIME OF MODEL BUILDING, SCALABILITY
O(N*log(N)) per node (ordering)
Time of model building
Depends on tree structure
200
Acceptable
180
160
140
Scales linearly 120
Time (s)
Experiments 100
80
60
40
20
0
Size of training set
Min of 20 Max of 20 Mean of 20
27. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 27
28. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 28
29. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 29
30. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 30
31. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 31
32. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 32
33. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,332858
-0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,985078
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 33
34. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 34
35. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 35
36. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
-1,16155
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,983634
0,600131
1,32624
Inf
0
Best score in the node (so far): 0,985078
0,983634
0,805777
Inf
0
Best ordering: 36
37. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,332858
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,983634
0,600131
Inf
0
Best score in the node (so far): 0,983634
0,805777
Inf
0
Best ordering: 37
38. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
ESOMax
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
1,02775
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,983634
0,600131
Inf
0
Best score in the node (so far): 0,983634
0,805777
Inf
0
Best ordering: 38
39. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
1,02775
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,983634
0,600131
Inf
0
Best score in the node (so far): 0,983634
0,805777
Inf
0
Best ordering: 39
40. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 40
41. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 41
42. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 42
43. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: CBOSimple
- Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 43
44. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 44
45. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 45
46. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,739969
-0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,805777
0,600131
Inf
0
Best score in the node (so far): 0,805777
Inf
0
Best ordering: 46
47. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,739969
-0,700739
0,390093
- Best threshold by current dynamic attribute: -0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,600131
Inf
0
Best score in the node (so far): Inf
0
Best ordering: 47
48. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
ESONext100
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
0,390093
- Best threshold by current dynamic attribute: -0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,600131
Inf
0
Best score in the node (so far): Inf
0
Best ordering: 48
49. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
- Best threshold by current dynamic attribute: -0,700739
0,390093
0,369887
0,77183
2,48622
-
Score of the best split by current dyn. attribute : 0,600131
Inf
0
Best score in the node (so far): Inf
0
Best ordering: 49
50. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
- Best threshold by current dynamic attribute: -0,700739
0,369887
2,48622
-
Score of the best split by current dyn. attribute : Inf
0
Best score in the node (so far): Inf
0
Best ordering: 50
51. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
- Best threshold by current dynamic attribute: -0,700739
0,369887
2,48622
-
Score of the best split by current dyn. attribute : Inf
0
Best score in the node (so far): Inf
0
Best ordering: 51
52. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
- Best threshold by current dynamic attribute: -0,700739
0,369887
2,48622
-
Score of the best split by current dyn. attribute : Inf
0
Best score in the node (so far): Inf
0
Best ordering: 52
53. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
- Best threshold by current dynamic attribute: -0,700739
0,369887
2,48622
Score of the best split by current dyn. attribute : 0
Best score in the node (so far): 0
Best ordering: 53
54. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: ESONextMax
-
CBO: -
CBOSimple Dynamic attribute selection
M
Threshold: -0,700739
- Best threshold by current dynamic attribute: -0,700739
0,369887
2,48622
Score of the best split by current dyn. attribute : 0
Best score in the node (so far): 0
Best ordering: 54
55. LEARNING THE MODEL
Defined operators EyeShifter – Cursor position
ESONextMax
ESONextMax To the next local maxima
ESO ESONext100
ESONext100 Step forward 100
ESOMax
ESOMax To the global maxima
CBO CBSimple
CBOSimple Value at cursor position
ShiftTree
F(x)
ConditionBuilder - Ordering
Best split in node (so far)
ESO: -
CBO: - Dynamic attribute selection
M
Threshold: - Best threshold by current dynamic attribute: -0,700739
0,369887
2,48622
Score of the best split by current dyn. attribute : 0
Best score in the node (so far): 0
Best ordering: 55