Open in app

Sign In

Write

Sign In

William Scott
William Scott

272 Followers

Home

About

Nov 28, 2022

What did Jesus' Parable of Great Banquet mean?

‘I tell you, not one of those who were invited will get a taste of my banquet.’ Luke records the Parable of the Great Banquet said by Jesus which can be found in the Gospel of Luke 14:15–24. …

4 min read

What did Jesus' Parable of Great Banquet mean?
What did Jesus' Parable of Great Banquet mean?

4 min read


Mar 25, 2019

PinSage: How Pinterest improved their recommendation system?

Graph Convolutional Neural Networks for Web-Scale Recommender Systems — So finally Pinterest has deployed PinSage as their recommender system and everyone is really excited about the change and the shift in paradigm. But what is it really and how is it related to GraphSAGE? If we look at PinSage title it reads as follows Graph Convolutional Neural Networks for…

Machine Learning

15 min read

PinSage: How Pinterest improved their recommendation system?
PinSage: How Pinterest improved their recommendation system?
Machine Learning

15 min read


Mar 1, 2019

Neural Network observations with change in parameters

Implementing Neural Networks and checking how the accuracy changes upon the change of parameters find the code here. Question 1 Self-Implemented NN: Accuracy:

Machine Learning

4 min read

Neural Network observations wit
Neural Network observations wit
Machine Learning

4 min read


Mar 1, 2019

Decision Tree vs Random Forest

This blog is about the results and observations of the works in Decision Tree and Random Forest. Click here to check the code and the problem statement. Part A:

Machine Learning

3 min read

Decision Tree vs Random Forest
Decision Tree vs Random Forest
Machine Learning

3 min read


Published in

Towards Data Science

·Feb 15, 2019

TF-IDF from scratch in python on a real-world dataset.

Table of Contents: What is TF-IDF? Preprocessing data. Weights to title and body. Document retrieval using TF-IDF matching score. Document retrieval using TF-IDF cosine similarity. Introduction: TF-IDF TF-IDF stands for “Term Frequency — Inverse Document Frequency”. This is a technique to quantify words in a set of documents. We generally compute a score for each…

Data Science

19 min read

TF-IDF for Document Ranking from scratch in python on real world dataset.
TF-IDF for Document Ranking from scratch in python on real world dataset.
Data Science

19 min read


Feb 3, 2019

Introduction to Information Retrieval

This is a series on Information Retrieval techniques with implementation basic concepts and easily understandable examples. For those who are highly interested, i suggest the book “Introduction to Information Retrieval” book by Manning Click here to checkout the git repo. Information Retrieval Series: 1. Introduction 2. Unigram Indexing & Positional Indexing 3. TF-IDF …

Search

3 min read

Search

3 min read


Jan 27, 2019

Artificial Intelligence: 6. Q Learning and SARS on Maze in OpenAI

Code: GitRepo Hyperparameters Used: - Learning Rate - Discount Rate - Exploration Rate Learning Rate [0, 1]: Learning rate is the rate of learning or the amount of information that we are taking from the current iteration into the Q-table. Discount Rate [0, 1]: Discount rate is the amount of…

Machine Learning

4 min read

Machine Learning

4 min read


Jan 27, 2019

Artificial Intelligence: 5. Ant Colony Optimisation (ACO) on TSP

Code: GitRepo Assumptions: - Termination condition is assumed to be “similarity of path taken by all the ants” - The count of ants is taken as twice the count of cities, by default - Other than these, ACO is implement as per the algorithm - Alpha is the influence on…

Algorithms

2 min read

Algorithms

2 min read


Jan 27, 2019

Artificial Intelligence: 4. GA, MA, CSP for Timetable Generation

Code: GitRepo Genetic Algorithm (GA) - There is always a sub-optimal solution during the generations in GA and MA. We need not wait for thousands of years just to get to the optimal answer. - All the timetable algorithms and constraints are developed considering the IIITD timetable and the staff and lecture halls…

Data Science

8 min read

Data Science

8 min read


Jan 27, 2019

Artificial Intelligence: 3. Minimax on tic-tac-toe

Code: GitHub Minimax Minimax is an algorithm which can never lose. Basically what happens here is that it increases its chances of winning and minimises the opponent’s chances of winning. Max → Min Min → Max Max will call min and min will call max recursively. This basically forms a game…

Minimax Algorithm

3 min read

Minimax Algorithm

3 min read

William Scott

William Scott

272 Followers

Senior Data Scientist and AI Researcher | https://twitter.com/PWilliamScott | https://www.linkedin.com/in/williamscottp/

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams