Name: Towards AI Legal Name: Towards AI, Inc. Description: Towards AI is the world's leading artificial intelligence (AI) and technology publication. Read by thought-leaders and decision-makers around the world. Phone Number: +1-650-246-9381 Email: pub@towardsai.net
228 Park Avenue South New York, NY 10003 United States
Website: Publisher: https://towardsai.net/#publisher Diversity Policy: https://towardsai.net/about Ethics Policy: https://towardsai.net/about Masthead: https://towardsai.net/about
Name: Towards AI Legal Name: Towards AI, Inc. Description: Towards AI is the world's leading artificial intelligence (AI) and technology publication. Founders: Roberto Iriondo, , Job Title: Co-founder and Advisor Works for: Towards AI, Inc. Follow Roberto: X, LinkedIn, GitHub, Google Scholar, Towards AI Profile, Medium, ML@CMU, FreeCodeCamp, Crunchbase, Bloomberg, Roberto Iriondo, Generative AI Lab, Generative AI Lab Denis Piffaretti, Job Title: Co-founder Works for: Towards AI, Inc. Louie Peters, Job Title: Co-founder Works for: Towards AI, Inc. Louis-François Bouchard, Job Title: Co-founder Works for: Towards AI, Inc. Cover:
Towards AI Cover
Logo:
Towards AI Logo
Areas Served: Worldwide Alternate Name: Towards AI, Inc. Alternate Name: Towards AI Co. Alternate Name: towards ai Alternate Name: towardsai Alternate Name: towards.ai Alternate Name: tai Alternate Name: toward ai Alternate Name: toward.ai Alternate Name: Towards AI, Inc. Alternate Name: towardsai.net Alternate Name: pub.towardsai.net
5 stars – based on 497 reviews

Frequently Used, Contextual References

TODO: Remember to copy unique IDs whenever it needs used. i.e., URL: 304b2e42315e

Resources

Take our 85+ lesson From Beginner to Advanced LLM Developer Certification: From choosing a project to deploying a working product this is the most comprehensive and practical LLM course out there!

Publication

Forecasting Time Series Data: Netflix Stock Price Prediction
Latest   Machine Learning

Forecasting Time Series Data: Netflix Stock Price Prediction

Last Updated on July 18, 2023 by Editorial Team

Author(s): Alison Yuhan Yao

Originally published on Towards AI.

ARIMA-(G)ARCH models with MiniTab and R

Photo by Jake Hills on Unsplash

The Netflix stock price has been quite volatile recently, which makes the prediction of the time series data very interesting. In this blog, I will use ARIMA-(G)ARCH models for prediction, Minitab for plotting, and R for model selection. (Because of the instructions of this class project, I will have to comply with some restrictions.)

Some prior knowledge before reading this blog includes:

Data Description

This project uses the daily stock price of Netflix from 2002–05–23 to 2022–03–18 (4991 observations) for the time series forecast. The 2022–03–18 data is the latest entry from Yahoo Finance as of the time I obtained the dataset. The head of the table is shown below:

Image by Author

I will leave out the last data point, which is the data for 2022–03–18 for the ARIMA-(G)ARCH modeling. Therefore, n=4991–1=4990 and I will be using the Adj Close data from 2002–05–23 to 2022–03–17.

ARIMA modeling

The time series plots of Netflix stock price (Adj Close), DifNetflix, LogNetflix, and DifLogNetflix are as follows:

Image by Author
Image by Author

There is strong evidence that Netflix has level-dependent volatility. Netflix stock prices are more volatile in recent years. Taking log can help us mitigate level-dependent volatility and linearize the plot, as the volatility of DifLogNetflix does not seem to depend on a level anymore.

For choosing an ARIMA(p,d,q) model, we need to first determine the value of d and see how many times we need to difference the data to make it stationary. The ACF and PACF plot of LogNetflix is as follows:

Image by Author

The ACF plot of LogNetflix indicates a hanging behavior and the PACF plot of LogNetflix cuts off after lag 1, so LogNetflix is non-stationary. We need to difference the data.

The ACF and PACF plots of DifLogNetflix show that differencing once seems to make the data stationary, as there are no statistically significant lags.

Image by Author

To double-check if d=1, we can difference the data again and look for a sign of over-differencing.

Image by Author

Indeed, differencing twice shows strong evidence of over-differencing as the PCF of Dif2LogNetflix is statistically significantly negative at lag 1 and close to -0.5. Therefore, we conclude that d=1 in the ARIMA model. The ACF plot of DifLogNetflix suggests an ARIMA(0,1,4) model, while the PACF of DifLogNetflix suggests an ARIMA(4,1,0) model.

Now, we need to select the p and q in the ARIMA model. Let’s pick p,q = 0,1,2 arbitrarily (because of the principle of parsimony) and compare AICc. The formula for AICc is as follows:

Image by Author

The SS means the sum of squared error and it can be obtained from Minitab output. We know N = n–d = 4990–1 = 4989.

Image by Author

ARIMA(0,1,1) with constant gives us the smallest AICc value, so we choose ARIMA(0,1,1) with constant. The Minitab output for ARIMA(0,1,1) with constant is:

Image by Author

Both the MA1 coefficient and the constant are statistically significant, with p-values less than 0.05. Therefore, if we denote {x_t} as the time series of Netflix, {y_t} as LogNetflix and {z_t} as DifLogNetflix. The best estimate of the MA1 coefficient is -0.0309 and that of the constant is 0.001151. Therefore, the fitted model is

Image by Author

where z_t = y_t-y_{t-1} = log(x_t)-log(x_{t-1}).

The one step ahead forecast and 95% forecast interval are as follows:

Image by Author

The time series plot of the residuals is:

Image by Author

The residuals look relatively random, with only a few with absolute values over 0.3. The ACF and PACF plots of the residuals are as follows:

Image by Author

There aren’t many statistically significant lags in the residuals, meaning that the residuals look uncorrelated. The ACF and PACF of squared residuals are:

Image by Author

However, the squared residuals have multiple lags that are statistically significant, meaning that the residuals are not independent. Also, we can see from the time series plot of the residuals that the variance is not constant. There exists evidence of conditional heteroscedasticity.

Before doing the (G)ARCH modeling, we need to save the residual information from Minitab to a txt file and import it into R.

# read file & check head
res = scan("RES.txt", what="list")
head(res)
# clean up data & convert data type
res = res[-c(1,2)]
res = as.numeric(res)
head(res)

(G)ARCH modeling

ARCH(q)

To select the ARCH(q) model with q ranging from 0 to 10, we can calculate the AICc. The formula for AICc changes here:

Image by Author

The values of logLik can be obtained from R.

library(tseries)# check different ARCH models
for (i in 1:10){
print(paste0('model ARCH(', i, ')'))
model = garch(res, c(0,i), trace=F)
print(summary(model))
print(logLik(model))
}
# ARCH(0) model has to be manually calculated
# model = garch(res, c(0,0), trace=F) is going to give an error
N = 4989
print(paste0('log Lik.', -0.5*N*(1+log(2*pi*mean(res^2)))))

Again, we know N = n–d = 4990–1 = 4989, so we have:

Image by Author

GARCH(1,1)

We can also consider the GARCH(1,1) model due to the principle of parsimony. We have logLik = 9799.593 (q=2) and the corresponding AICc is -19593.18118555667. GARCH(1,1) yields the smallest AICc, so we choose GARCH(1,1).

# compared with GARCH(1,1) model
model=garch(res,c(1,1), trace=F)
print(summary(model))
print(logLik(model))
Image by Author

The p-values are not correct because they are for a 2-tailed test. We should look at half of the presented p-values, but they are so small that half of any of these p-values is strongly statistically significant. Therefore, a0, a1, and b1 are all statistically significant. However, the Jarque Bera test has a p-value less than 0.05, which indicates that the conditional distribution of GARCH residuals is not normally distributed. The Ljung-Box test has a p-value greater than 0.05, which means that the GARCH residuals are not correlated. But overall, the model is inadequate.

To write the complete form of the chosen GARCH(1,1) model, we have ω=0.000005875, α=0.01425, and β=0.9814. Therefore, the complete form is

Image by Author

The unconditional variance is

Image by Author

We know from the residual data that ϵ_4990=0.035765. We also know that h_4990=0.00138539642318183. Therefore,
h_4991=0.000005875 + 0.01425 × 0.035765² + 0.9814 × 0.00138539642318183 = 0.001383731.

From the ARIMA(0,1,1) model, we know that f_4990,1=5.91954. The 95% forecast interval of the ARIMA-GARCH model is, therefore:

Image by Author

Compared to the ARIMA(0,1,1) model, which has a 95% forecast interval of (5.84927, 5.98981), the ARIMA-GARCH model has a wider forecast interval.

The 5th percentile of the conditional distribution of the next period’s log exchange rate is:

Image by Author

Now we calculate the conditional variance ht:

# calculate ht
ht = model$fit[,1]^2
ht[1:5] # has NA
write(c('ht', '*', ht), '../htfile.txt', 1)

The time series plot of ht is:

Image by Author

The ht from 2002/5/23 to 2014/4/14 is more volatile than later ht. Bursts of high volatility reside between 2002/5/23 to 2014/4/14, with the highest volatility residing between 2022/5/23 to 2005/5/9.

Image by Author

Compared with the time series plot of LogNetflix, it seems that these bursts of high volatility do agree with those found from the examination of the time series plot of the log exchange rates themselves.

The time series plot of logNetflix and one-step ahead 95% forecast intervals is as follows:

Image by Author

According to the plot, LogNetflix is mostly between low and high, so the forecast interval is quite accurate. However, since the ARIMA-GARCH parameters are estimated from the entire data set, not just the observations up to the time at which the forecast is to be constructed, the performance may be somewhat better here than in an actual forecasting context, so the practical usefulness is somewhat questionable for x_1 to x_4990. However, x_4991 was not utilized in building the ARIMA-GARCH model, so the forecast for x_4991 is more practically useful.

Image by Author

The test tells us that the p-value is smaller than 0.005, so archres are not normally distributed. The s-shaped plot is an indicator that a heavier tail, which means that the model does not seem to have adequately described the leptokurtosis in the data.

There are 209 failures in prediction intervals, which is about 209/4988 = 4.19% of all intervals.

Image by Author

Performance Check

For LogNetflix, the 95% forecast interval of the ARIMA model is (5.84927, 5.98981), which corresponds to an interval of (347.89, 399.339) for Netflix. x_4991=380.6 is within the forecast interval.

The 95% forecast interval of the ARIMA-GARCH model is (5.846631, 5.992449), which corresponds to an interval of (346.0665, 400.39398) for Netflix. x_4991=380.6 is within the forecast interval.

The ARIMA interval and ARIMA-GARCH interval are very similar. Both forecast intervals seem neither too wide nor too narrow. The ARIMA-GARCH interval is slightly wider to adapt to the recent higher volatility because ARIMA-GARCH is adaptive, but ARIMA is not.

Join thousands of data leaders on the AI newsletter. Join over 80,000 subscribers and keep up to date with the latest developments in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

Published via Towards AI

Feedback ↓

Sign Up for the Course
`; } else { console.error('Element with id="subscribe" not found within the page with class "home".'); } } }); // Remove duplicate text from articles /* Backup: 09/11/24 function removeDuplicateText() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, strong'); // Select the desired elements const seenTexts = new Set(); // A set to keep track of seen texts const tagCounters = {}; // Object to track instances of each tag elements.forEach(el => { const tagName = el.tagName.toLowerCase(); // Get the tag name (e.g., 'h1', 'h2', etc.) // Initialize a counter for each tag if not already done if (!tagCounters[tagName]) { tagCounters[tagName] = 0; } // Only process the first 10 elements of each tag type if (tagCounters[tagName] >= 2) { return; // Skip if the number of elements exceeds 10 } const text = el.textContent.trim(); // Get the text content const words = text.split(/\s+/); // Split the text into words if (words.length >= 4) { // Ensure at least 4 words const significantPart = words.slice(0, 5).join(' '); // Get first 5 words for matching // Check if the text (not the tag) has been seen before if (seenTexts.has(significantPart)) { // console.log('Duplicate found, removing:', el); // Log duplicate el.remove(); // Remove duplicate element } else { seenTexts.add(significantPart); // Add the text to the set } } tagCounters[tagName]++; // Increment the counter for this tag }); } removeDuplicateText(); */ // Remove duplicate text from articles function removeDuplicateText() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, strong'); // Select the desired elements const seenTexts = new Set(); // A set to keep track of seen texts const tagCounters = {}; // Object to track instances of each tag // List of classes to be excluded const excludedClasses = ['medium-author', 'post-widget-title']; elements.forEach(el => { // Skip elements with any of the excluded classes if (excludedClasses.some(cls => el.classList.contains(cls))) { return; // Skip this element if it has any of the excluded classes } const tagName = el.tagName.toLowerCase(); // Get the tag name (e.g., 'h1', 'h2', etc.) // Initialize a counter for each tag if not already done if (!tagCounters[tagName]) { tagCounters[tagName] = 0; } // Only process the first 10 elements of each tag type if (tagCounters[tagName] >= 10) { return; // Skip if the number of elements exceeds 10 } const text = el.textContent.trim(); // Get the text content const words = text.split(/\s+/); // Split the text into words if (words.length >= 4) { // Ensure at least 4 words const significantPart = words.slice(0, 5).join(' '); // Get first 5 words for matching // Check if the text (not the tag) has been seen before if (seenTexts.has(significantPart)) { // console.log('Duplicate found, removing:', el); // Log duplicate el.remove(); // Remove duplicate element } else { seenTexts.add(significantPart); // Add the text to the set } } tagCounters[tagName]++; // Increment the counter for this tag }); } removeDuplicateText(); //Remove unnecessary text in blog excerpts document.querySelectorAll('.blog p').forEach(function(paragraph) { // Replace the unwanted text pattern for each paragraph paragraph.innerHTML = paragraph.innerHTML .replace(/Author\(s\): [\w\s]+ Originally published on Towards AI\.?/g, '') // Removes 'Author(s): XYZ Originally published on Towards AI' .replace(/This member-only story is on us\. Upgrade to access all of Medium\./g, ''); // Removes 'This member-only story...' }); //Load ionic icons and cache them if ('localStorage' in window && window['localStorage'] !== null) { const cssLink = 'https://code.ionicframework.com/ionicons/2.0.1/css/ionicons.min.css'; const storedCss = localStorage.getItem('ionicons'); if (storedCss) { loadCSS(storedCss); } else { fetch(cssLink).then(response => response.text()).then(css => { localStorage.setItem('ionicons', css); loadCSS(css); }); } } function loadCSS(css) { const style = document.createElement('style'); style.innerHTML = css; document.head.appendChild(style); } //Remove elements from imported content automatically function removeStrongFromHeadings() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, h6, span'); elements.forEach(el => { const strongTags = el.querySelectorAll('strong'); strongTags.forEach(strongTag => { while (strongTag.firstChild) { strongTag.parentNode.insertBefore(strongTag.firstChild, strongTag); } strongTag.remove(); }); }); } removeStrongFromHeadings(); "use strict"; window.onload = () => { /* //This is an object for each category of subjects and in that there are kewords and link to the keywods let keywordsAndLinks = { //you can add more categories and define their keywords and add a link ds: { keywords: [ //you can add more keywords here they are detected and replaced with achor tag automatically 'data science', 'Data science', 'Data Science', 'data Science', 'DATA SCIENCE', ], //we will replace the linktext with the keyword later on in the code //you can easily change links for each category here //(include class="ml-link" and linktext) link: 'linktext', }, ml: { keywords: [ //Add more keywords 'machine learning', 'Machine learning', 'Machine Learning', 'machine Learning', 'MACHINE LEARNING', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, ai: { keywords: [ 'artificial intelligence', 'Artificial intelligence', 'Artificial Intelligence', 'artificial Intelligence', 'ARTIFICIAL INTELLIGENCE', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, nl: { keywords: [ 'NLP', 'nlp', 'natural language processing', 'Natural Language Processing', 'NATURAL LANGUAGE PROCESSING', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, des: { keywords: [ 'data engineering services', 'Data Engineering Services', 'DATA ENGINEERING SERVICES', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, td: { keywords: [ 'training data', 'Training Data', 'training Data', 'TRAINING DATA', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, ias: { keywords: [ 'image annotation services', 'Image annotation services', 'image Annotation services', 'image annotation Services', 'Image Annotation Services', 'IMAGE ANNOTATION SERVICES', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, l: { keywords: [ 'labeling', 'labelling', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, pbp: { keywords: [ 'previous blog posts', 'previous blog post', 'latest', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, mlc: { keywords: [ 'machine learning course', 'machine learning class', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, }; //Articles to skip let articleIdsToSkip = ['post-2651', 'post-3414', 'post-3540']; //keyword with its related achortag is recieved here along with article id function searchAndReplace(keyword, anchorTag, articleId) { //selects the h3 h4 and p tags that are inside of the article let content = document.querySelector(`#${articleId} .entry-content`); //replaces the "linktext" in achor tag with the keyword that will be searched and replaced let newLink = anchorTag.replace('linktext', keyword); //regular expression to search keyword var re = new RegExp('(' + keyword + ')', 'g'); //this replaces the keywords in h3 h4 and p tags content with achor tag content.innerHTML = content.innerHTML.replace(re, newLink); } function articleFilter(keyword, anchorTag) { //gets all the articles var articles = document.querySelectorAll('article'); //if its zero or less then there are no articles if (articles.length > 0) { for (let x = 0; x < articles.length; x++) { //articles to skip is an array in which there are ids of articles which should not get effected //if the current article's id is also in that array then do not call search and replace with its data if (!articleIdsToSkip.includes(articles[x].id)) { //search and replace is called on articles which should get effected searchAndReplace(keyword, anchorTag, articles[x].id, key); } else { console.log( `Cannot replace the keywords in article with id ${articles[x].id}` ); } } } else { console.log('No articles found.'); } } let key; //not part of script, added for (key in keywordsAndLinks) { //key is the object in keywords and links object i.e ds, ml, ai for (let i = 0; i < keywordsAndLinks[key].keywords.length; i++) { //keywordsAndLinks[key].keywords is the array of keywords for key (ds, ml, ai) //keywordsAndLinks[key].keywords[i] is the keyword and keywordsAndLinks[key].link is the link //keyword and link is sent to searchreplace where it is then replaced using regular expression and replace function articleFilter( keywordsAndLinks[key].keywords[i], keywordsAndLinks[key].link ); } } function cleanLinks() { // (making smal functions is for DRY) this function gets the links and only keeps the first 2 and from the rest removes the anchor tag and replaces it with its text function removeLinks(links) { if (links.length > 1) { for (let i = 2; i < links.length; i++) { links[i].outerHTML = links[i].textContent; } } } //arrays which will contain all the achor tags found with the class (ds-link, ml-link, ailink) in each article inserted using search and replace let dslinks; let mllinks; let ailinks; let nllinks; let deslinks; let tdlinks; let iaslinks; let llinks; let pbplinks; let mlclinks; const content = document.querySelectorAll('article'); //all articles content.forEach((c) => { //to skip the articles with specific ids if (!articleIdsToSkip.includes(c.id)) { //getting all the anchor tags in each article one by one dslinks = document.querySelectorAll(`#${c.id} .entry-content a.ds-link`); mllinks = document.querySelectorAll(`#${c.id} .entry-content a.ml-link`); ailinks = document.querySelectorAll(`#${c.id} .entry-content a.ai-link`); nllinks = document.querySelectorAll(`#${c.id} .entry-content a.ntrl-link`); deslinks = document.querySelectorAll(`#${c.id} .entry-content a.des-link`); tdlinks = document.querySelectorAll(`#${c.id} .entry-content a.td-link`); iaslinks = document.querySelectorAll(`#${c.id} .entry-content a.ias-link`); mlclinks = document.querySelectorAll(`#${c.id} .entry-content a.mlc-link`); llinks = document.querySelectorAll(`#${c.id} .entry-content a.l-link`); pbplinks = document.querySelectorAll(`#${c.id} .entry-content a.pbp-link`); //sending the anchor tags list of each article one by one to remove extra anchor tags removeLinks(dslinks); removeLinks(mllinks); removeLinks(ailinks); removeLinks(nllinks); removeLinks(deslinks); removeLinks(tdlinks); removeLinks(iaslinks); removeLinks(mlclinks); removeLinks(llinks); removeLinks(pbplinks); } }); } //To remove extra achor tags of each category (ds, ml, ai) and only have 2 of each category per article cleanLinks(); */ //Recommended Articles var ctaLinks = [ /* ' ' + '

Subscribe to our AI newsletter!

' + */ '

Take our 85+ lesson From Beginner to Advanced LLM Developer Certification: From choosing a project to deploying a working product this is the most comprehensive and practical LLM course out there!

'+ '

Towards AI has published Building LLMs for Production—our 470+ page guide to mastering LLMs with practical projects and expert insights!

' + '
' + '' + '' + '

Note: Content contains the views of the contributing authors and not Towards AI.
Disclosure: This website may contain sponsored content and affiliate links.

' + 'Discover Your Dream AI Career at Towards AI Jobs' + '

Towards AI has built a jobs board tailored specifically to Machine Learning and Data Science Jobs and Skills. Our software searches for live AI jobs each hour, labels and categorises them and makes them easily searchable. Explore over 10,000 live jobs today with Towards AI Jobs!

' + '
' + '

🔥 Recommended Articles 🔥

' + 'Why Become an LLM Developer? Launching Towards AI’s New One-Stop Conversion Course'+ 'Testing Launchpad.sh: A Container-based GPU Cloud for Inference and Fine-tuning'+ 'The Top 13 AI-Powered CRM Platforms
' + 'Top 11 AI Call Center Software for 2024
' + 'Learn Prompting 101—Prompt Engineering Course
' + 'Explore Leading Cloud Providers for GPU-Powered LLM Training
' + 'Best AI Communities for Artificial Intelligence Enthusiasts
' + 'Best Workstations for Deep Learning
' + 'Best Laptops for Deep Learning
' + 'Best Machine Learning Books
' + 'Machine Learning Algorithms
' + 'Neural Networks Tutorial
' + 'Best Public Datasets for Machine Learning
' + 'Neural Network Types
' + 'NLP Tutorial
' + 'Best Data Science Books
' + 'Monte Carlo Simulation Tutorial
' + 'Recommender System Tutorial
' + 'Linear Algebra for Deep Learning Tutorial
' + 'Google Colab Introduction
' + 'Decision Trees in Machine Learning
' + 'Principal Component Analysis (PCA) Tutorial
' + 'Linear Regression from Zero to Hero
'+ '

', /* + '

Join thousands of data leaders on the AI newsletter. It’s free, we don’t spam, and we never share your email address. Keep up to date with the latest work in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

',*/ ]; var replaceText = { '': '', '': '', '
': '
' + ctaLinks + '
', }; Object.keys(replaceText).forEach((txtorig) => { //txtorig is the key in replacetext object const txtnew = replaceText[txtorig]; //txtnew is the value of the key in replacetext object let entryFooter = document.querySelector('article .entry-footer'); if (document.querySelectorAll('.single-post').length > 0) { //console.log('Article found.'); const text = entryFooter.innerHTML; entryFooter.innerHTML = text.replace(txtorig, txtnew); } else { // console.log('Article not found.'); //removing comment 09/04/24 } }); var css = document.createElement('style'); css.type = 'text/css'; css.innerHTML = '.post-tags { display:none !important } .article-cta a { font-size: 18px; }'; document.body.appendChild(css); //Extra //This function adds some accessibility needs to the site. function addAlly() { // In this function JQuery is replaced with vanilla javascript functions const imgCont = document.querySelector('.uw-imgcont'); imgCont.setAttribute('aria-label', 'AI news, latest developments'); imgCont.title = 'AI news, latest developments'; imgCont.rel = 'noopener'; document.querySelector('.page-mobile-menu-logo a').title = 'Towards AI Home'; document.querySelector('a.social-link').rel = 'noopener'; document.querySelector('a.uw-text').rel = 'noopener'; document.querySelector('a.uw-w-branding').rel = 'noopener'; document.querySelector('.blog h2.heading').innerHTML = 'Publication'; const popupSearch = document.querySelector$('a.btn-open-popup-search'); popupSearch.setAttribute('role', 'button'); popupSearch.title = 'Search'; const searchClose = document.querySelector('a.popup-search-close'); searchClose.setAttribute('role', 'button'); searchClose.title = 'Close search page'; // document // .querySelector('a.btn-open-popup-search') // .setAttribute( // 'href', // 'https://medium.com/towards-artificial-intelligence/search' // ); } // Add external attributes to 302 sticky and editorial links function extLink() { // Sticky 302 links, this fuction opens the link we send to Medium on a new tab and adds a "noopener" rel to them var stickyLinks = document.querySelectorAll('.grid-item.sticky a'); for (var i = 0; i < stickyLinks.length; i++) { /* stickyLinks[i].setAttribute('target', '_blank'); stickyLinks[i].setAttribute('rel', 'noopener'); */ } // Editorial 302 links, same here var editLinks = document.querySelectorAll( '.grid-item.category-editorial a' ); for (var i = 0; i < editLinks.length; i++) { editLinks[i].setAttribute('target', '_blank'); editLinks[i].setAttribute('rel', 'noopener'); } } // Add current year to copyright notices document.getElementById( 'js-current-year' ).textContent = new Date().getFullYear(); // Call functions after page load extLink(); //addAlly(); setTimeout(function() { //addAlly(); //ideally we should only need to run it once ↑ }, 5000); }; function closeCookieDialog (){ document.getElementById("cookie-consent").style.display = "none"; return false; } setTimeout ( function () { closeCookieDialog(); }, 15000); console.log(`%c 🚀🚀🚀 ███ █████ ███████ █████████ ███████████ █████████████ ███████████████ ███████ ███████ ███████ ┌───────────────────────────────────────────────────────────────────┐ │ │ │ Towards AI is looking for contributors! │ │ Join us in creating awesome AI content. │ │ Let's build the future of AI together → │ │ https://towardsai.net/contribute │ │ │ └───────────────────────────────────────────────────────────────────┘ `, `background: ; color: #00adff; font-size: large`); //Remove latest category across site document.querySelectorAll('a[rel="category tag"]').forEach(function(el) { if (el.textContent.trim() === 'Latest') { // Remove the two consecutive spaces (  ) if (el.nextSibling && el.nextSibling.nodeValue.includes('\u00A0\u00A0')) { el.nextSibling.nodeValue = ''; // Remove the spaces } el.style.display = 'none'; // Hide the element } }); // Add cross-domain measurement, anonymize IPs 'use strict'; //var ga = gtag; ga('config', 'G-9D3HKKFV1Q', 'auto', { /*'allowLinker': true,*/ 'anonymize_ip': true/*, 'linker': { 'domains': [ 'medium.com/towards-artificial-intelligence', 'datasets.towardsai.net', 'rss.towardsai.net', 'feed.towardsai.net', 'contribute.towardsai.net', 'members.towardsai.net', 'pub.towardsai.net', 'news.towardsai.net' ] } */ }); ga('send', 'pageview'); -->