Doc heatmap

Document Heat Map: The Definitive Guide

Posted 2 CommentsPosted in Blog

The goal is to create a program where two site’s contents can be compared and represent to show their similarities in a heatmap. This is used in professional SEO services. By using Hierarchical clustering and K mean Clustering, a group of terms has been selected according to their TF. Then it is shown and compared side by side in a form of Document heat map form where the colors represent their TF in that particular […]

co-occurence matrix

Co-occurrence Matrix : The Definitive Guide

Posted Leave a commentPosted in Blog

A co-occurrence matrix, also referred to as a co-occurrence distribution, is defined over an image to be the distribution of co-occurring values at a given offset. Any matrix or pair of matrices can be used to generate a co-occurrence matrix, though their most common application and also in best SEO strategies. In this case, we used co-occurrence matrix to differ out the co-occurring terms from the main site’s content and the competitor site’s content in […]

Manual CORA

Manual Cora : The Definitive Guide

Posted Leave a commentPosted in Blog

Website correlation, or website matching, is a process used to identify websites that have similar content or similar tags or similar structure. This concept is used in latest SEO techniques. Correlation of the main site and the competitor site can help to analyze how your site is different from the competitors and what is lacking to get improvement. There are also some mathematical formulas to correlate 1. Pearson correlation coefficient           […]

stock price markov chain

Markov Chains : The Definitive Guide

Posted Leave a commentPosted in Blog

Markov chains are mathematical systems that hop from one “state” (a situation or set of values) to another. Also a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. The state space, or set of all possible states, can be anything: letters, numbers, weather conditions, baseball scores, or stock performances. Markov chains may be modeled by finite state machines, and random walks provide […]

kohens kappa

Fleiss Kappa: The definitive Guide

Posted Leave a commentPosted in Blog

Cohen’s kappa is a measure of the agreement between two raters (or more), where agreement due to chance is factored out. We now extend Cohen’s kappa to the case where the number of raters can be more than two. This extension is called Fleiss’ kappa.  This extension is used in SEO marketing companies. Source [http://www.real-statistics.com/reliability/fleiss-kappa/ ] I have taken a supervised data subjects, which is observed from several websites, whether the particular subject or point is present or […]

Jaccard Index - ThatWare

Jaccard Similarity : The Definitive Guide

Posted Leave a commentPosted in Blog

The Jaccard index, also known as Intersection over Union and the Jaccard similarity coefficient, is a statistic used for comparing the similarity and diversity of sample sets. The Jaccard index is used in small business SEO. The Jaccard coefficient measures the similarity between finite sample sets and is defined as the size of the intersection divided by the size of the union of the sample sets:https://thatware.co/advanced-seo/ Source [https://en.wikipedia.org/wiki/Jaccard_index] Loading Libraries: Loading stopwords files: Text Data input: This line […]

Sentiment analysis

Sentiment Analysis : The Definitive Guide

Posted Leave a commentPosted in Blog

The process of computationally identifying and categorizing opinions expressed in a piece of text, especially in order to determine whether the writer’s attitude towards a particular topic, product, etc. is positive, negative, or neutral. This is also used by SEO service provider. Loading libraries: Reading the text file: Reading the files from the default DIR and then taking the files into a data frame. Two text files: “medical blog” and “medical blog2”. Seo company can […]

Bag of words

Bag of words : The Definitive Guide

Posted Leave a commentPosted in Blog

The bag-of-words model is a way of representing text data when modeling text with machine learning algorithms. This model is a way of extracting features from the text for use in modeling, such as with machine learning algorithms. This describes the occurrence of words within a document. This is used in professional SEO services. The Bag-of-words model is mainly used as a tool of feature generation. After transforming the text into a “bag of words”, […]

naive bayes

Naive Bayes : The Definitive Guide

Posted 2 CommentsPosted in Blog

Naive Bayes is a probabilistic classifier which is based on Bayes theorem. Bayes theorem provides a way of calculating the posterior probability. Naive Bayes classifier assumes that the effect of the value of a predictor (x) on a given class (c) is independent of the values of other predictors. This assumption is called class conditional independence. Naive Bayes is used for choosing the latest SEO techniques. Bayesian probability: Posterior = prior x likelihood/evidence Imported library: […]

rocchio algorithm

Rocchio Algorithm : The Definitive Guide

Posted 2 CommentsPosted in Blog

Rocchio algorithm is based on a method of relevance feedback. The Rocchio algorithm incorporates relevance feedback information into the vector space model, the Rocchio feedback approach was developed using the Vector Space Model. This algorithm has a general conception of which documents should be denoted as relevant or non-relevant. Therefore, the search query includes an arbitrary percentage of relevant and non-relevant documents as a means of increasing the search engine’s recall, and possibly the precision […]