Nov 02

Might be of Interest to the readers of this platform

Self Learning AI-Agents Part II: Deep Q-Learning
https://towardsdatascience.com/self-learning-ai-agents-part-ii-deep-q-learning-b5ac60c3f47

Canada’s flawed financial advice industryCommissions and conflicting interests persist – when are we going to get the value we deserve?
https://www.morningstar.ca/ca/news/196072/canadas-flawed-financial-advice-industry.aspx

Whatever the Future Holds, Stocks Are Not Priced for a Recession
https://www.bloomberg.com/news/articles/2019-10-06/whatever-the-future-holds-stocks-are-not-priced-for-a-recession?srnd=premium-canada

Machine Learning Model Deployment: Strategy to Implementation
https://www.youtube.com/watch?v=xEG8u62TB2Q

—
Sayed Ahmed

Linkedin: https://ca.linkedin.com/in/sayedjustetc

Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
Online and Offline Training: http://Training.SitesTree.com

Affiliate Links:
Hottest Deals on Amazon USA: http://tiny.cc/38lddz

Hottest Deals on Amazon CA: http://tiny.cc/bgnddz

Hottest Deals on Amazon Europe: http://tiny.cc/w4nddz



However, if you want to contribute to the operation of this site (or charitable/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com using Paypal.

Nov 02

Industry Job Prospect for Graph Mining

Industry Job Prospect for Graph Mining

Sample Jobs

https://www.careerbuilder.com/jobs-graph-mining

https://www.indeed.com/q-Graph-Mining-jobs.html

For example, Google works in these areas of Graph Mining and Google has jobs for such. Also, Facebook and any other social networking site will have jobs in relation to Graph Mining. For details, open this page.

Job Areas:

The general Mining (data based) jobs and Machine/Deep/Reinforcement Learning jobs will require Graph Mining expertise sometimes such as positions (real) : Research Intern – Deep Learning for Graphs, ML Engineer – Siri Knowledge Graph

Computer Networks, Network/Cyber Security application development (also R & D) positions might ask for Graph Mining expertise.

Graph Mining will have applications and jobs in Biological, Chemistry, Drug Design areas also in Transportation

Social Network Mining will always involve Graph Mining. Applications: Friend Recommendation

Trajectory Data Mining Jobs at Microsoft

https://www.microsoft.com/en-us/research/publication/trajectory-data-mining-an-overview/

Graph Mining Jobs (areas) at Google:
https://ai.google/research/teams/algorithms-optimization/graph-mining/

Large-Scale Balanced Partitioning: Example Google Maps Driving Directions, Large-Scale Clustering:clustering graphs at Google scale, Large-Scale Connected Components, Large-Scale Link Modeling: similarity ranking and centrality metrics: link prediction and anomalous link discovery., Large-Scale Similarity Ranking: Personalized PageRank, Egonet similarity, Adamic Adar, and others, Public-private Graph Computation, Streaming and Dynamic Graph Algorithms, ASYMP: Async Message Passing Graph Mining, Large-Scale Centrality Ranking, Large-Scale Graph Building

More Related Jobs:

Tools in Jobs/Jobs–https://www.researchgate.net/post/Can_you_suggest_a_graph_mining_tool

—https://www.linkedin.com/jobs/gephi-jobs/

—https://bit.ly/2Nwlnrp Data Scientist 2

Oct 26

Future Startup Weekly

FS Weekly

Please find the updates that you missed from FS in last 7 days. If you enjoy them, please share the mail with others.

How GrameenPhone Was Created

Iqbal Quadir, founder of GrameenPhone and the founder and director emeritus of the Legatum Center for Development and Entrepreneurship at MIT, shared how Grameenphone was created and what it takes to make something of consequence. The story is an excerpt from this interview here. The journey I came from Bangladesh, from a relatively smaller town […]
How LightCastle Partners Was Created

Most journeys are nonlinear in nature. You don’t go straight from A to B. Rather you take a circuitous route – first go from A to C and then to B. For entrepreneurs, this is even more so. People who start companies don’t do it overnight. It is not like you to come up with […]
BProperty Expands Coverage To Tongi

Bproperty has signed an exclusive contract with Altaf Tower Ltd on 14 October 2019. Through this contract, Bproperty is expanding its’ operations out of the capital city, in Tongi. The Company will be responsible for the marketing of 54 units of the residential apartment – called Tahsia Manzil, constructed by Altaf Tower Ltd. The range […]
Building The Largest Digital Marketplace For Made In Bangladesh Products: An Interview With Zeeshan Khurshed Mazumder, Founder And CEO, BeshiDeshi

Zeeshan Khurshed Mazumder is the Founder And CEO of Beshi Deshi, a digital marketplace for made in Bangladesh products that helps artisans, craftsmen, and companies that make local products with customers both in Bangladesh and abroad. Founded in 2018, BeshiDeshi has grown significantly. The company says it has over 12,000 products of 200 different categories, 350+ Partners on its platform.
Inside Delivery Tiger’s Plans To Meaningfully Bring Down The Cost Of eCommerce Logistics

A new logistics company called Delivery Tiger, says it has figured a way to address the challenges of online delivery through building a logistics marketplace. Founded by Fahim Mashroor, Founder of Bdjobs.com and Ajkerdeal, Delivery Tiger says it can offer logistics services at a significantly lower price, 25 tk only anywhere in Bangladesh, and the widest coverage across the country.
How Solaric Was Created

Solaric is the SolarCity equivalent of Bangladesh – revolutionizing the solar energy space in this part of the world with innovations and better products. Officially launched in 2011, the company has seen meaningful growth over the past few years. In an interview with Future Startup, published in 2017, Mr. Didar Islam, Founder and Managing Director […]
How To Build A Profitable Tech Product Business In Bangladesh: An Interview With Abul Bashar Md Sharif, Director and COO, Easytrax

Abul Bashar Md Sharif is the Co-founder and COO of Easytrax, a Dhaka-based company that offers GPS tracking and fleet management solutions. Mr. Sharif co-founded the company along with his friend as a side project while working full-time at Grameenphone. After a few months into the business, he left his job at GP and became a full-time entrepreneur. The first year was tough. The growth was slow. There were too many challenges to address with limited resources. Mr. Sharif and his partner did not give up. Slowly and steadily the business grew. Today, Easytrax is one of the leading players in the GPS tracking and fleet management solutions space in Bangladesh. The company has built a profitable subscription business, expanded into new areas and is now looking to explore new growth opportunities.
How Can An Automated Dialer Help Your Startup Business Grow

Automatic or auto-dialers are part of Computer Telephone Integration (CTI) systems. Organizations use unique software, a modem, and a computer to let systems dial phone numbers. Many companies use these applications for cold calling and other marketing practices. If you’re interested in using an autodialer to help your startup business grow, continue reading to know […]
FS Weekly Review #31: Chaldal’s Pro-environment Initiative, Evaly Connect, IDLC VC Fund, And More

Grocery Shopping Without A Bag: How Chaldal Executed On An Ambitious Environmental Goal By Encouraging Its Users To Reuse Shopping Bags Chaldal, the leading online grocery company in Dhaka, has introduced an environment-friendly initiative a few months ago: its customers have to return the shopping bag that they receive during delivery of groceries. Customers could […]

Future Startup
Basilla Mohammadpur
Dhaka Dhaka 1209
Bangladesh

Oct 26

Future Startup Weekly

FS Weekly

Please find the updates that you missed from FS in last 7 days. If you enjoy them, please share the mail with others.

How GrameenPhone Was Created

Iqbal Quadir, founder of GrameenPhone and the founder and director emeritus of the Legatum Center for Development and Entrepreneurship at MIT, shared how Grameenphone was created and what it takes to make something of consequence. The story is an excerpt from this interview here. The journey I came from Bangladesh, from a relatively smaller town […]
How LightCastle Partners Was Created

Most journeys are nonlinear in nature. You don’t go straight from A to B. Rather you take a circuitous route – first go from A to C and then to B. For entrepreneurs, this is even more so. People who start companies don’t do it overnight. It is not like you to come up with […]
BProperty Expands Coverage To Tongi

Bproperty has signed an exclusive contract with Altaf Tower Ltd on 14 October 2019. Through this contract, Bproperty is expanding its’ operations out of the capital city, in Tongi. The Company will be responsible for the marketing of 54 units of the residential apartment – called Tahsia Manzil, constructed by Altaf Tower Ltd. The range […]
Building The Largest Digital Marketplace For Made In Bangladesh Products: An Interview With Zeeshan Khurshed Mazumder, Founder And CEO, BeshiDeshi

Zeeshan Khurshed Mazumder is the Founder And CEO of Beshi Deshi, a digital marketplace for made in Bangladesh products that helps artisans, craftsmen, and companies that make local products with customers both in Bangladesh and abroad. Founded in 2018, BeshiDeshi has grown significantly. The company says it has over 12,000 products of 200 different categories, 350+ Partners on its platform.
Inside Delivery Tiger’s Plans To Meaningfully Bring Down The Cost Of eCommerce Logistics

A new logistics company called Delivery Tiger, says it has figured a way to address the challenges of online delivery through building a logistics marketplace. Founded by Fahim Mashroor, Founder of Bdjobs.com and Ajkerdeal, Delivery Tiger says it can offer logistics services at a significantly lower price, 25 tk only anywhere in Bangladesh, and the widest coverage across the country.
How Solaric Was Created

Solaric is the SolarCity equivalent of Bangladesh – revolutionizing the solar energy space in this part of the world with innovations and better products. Officially launched in 2011, the company has seen meaningful growth over the past few years. In an interview with Future Startup, published in 2017, Mr. Didar Islam, Founder and Managing Director […]
How To Build A Profitable Tech Product Business In Bangladesh: An Interview With Abul Bashar Md Sharif, Director and COO, Easytrax

Abul Bashar Md Sharif is the Co-founder and COO of Easytrax, a Dhaka-based company that offers GPS tracking and fleet management solutions. Mr. Sharif co-founded the company along with his friend as a side project while working full-time at Grameenphone. After a few months into the business, he left his job at GP and became a full-time entrepreneur. The first year was tough. The growth was slow. There were too many challenges to address with limited resources. Mr. Sharif and his partner did not give up. Slowly and steadily the business grew. Today, Easytrax is one of the leading players in the GPS tracking and fleet management solutions space in Bangladesh. The company has built a profitable subscription business, expanded into new areas and is now looking to explore new growth opportunities.
How Can An Automated Dialer Help Your Startup Business Grow

Automatic or auto-dialers are part of Computer Telephone Integration (CTI) systems. Organizations use unique software, a modem, and a computer to let systems dial phone numbers. Many companies use these applications for cold calling and other marketing practices. If you’re interested in using an autodialer to help your startup business grow, continue reading to know […]
FS Weekly Review #31: Chaldal’s Pro-environment Initiative, Evaly Connect, IDLC VC Fund, And More

Grocery Shopping Without A Bag: How Chaldal Executed On An Ambitious Environmental Goal By Encouraging Its Users To Reuse Shopping Bags Chaldal, the leading online grocery company in Dhaka, has introduced an environment-friendly initiative a few months ago: its customers have to return the shopping bag that they receive during delivery of groceries. Customers could […]

Future Startup
Basilla Mohammadpur
Dhaka Dhaka 1209
Bangladesh

Oct 23

Join a Graph Mining Course

If you are interested to get access to a course (under development) on Graph Mining (Part of AI/Data Science/Analytics/ML), please request using the following Google Form (or just inform us your email in a way so that we can give you access):

https://docs.google.com/forms/d/e/1FAIpQLSerGzkN9WlWW6SyDwaV-zdcYuSpXXODk9JIBTp7–EA_WTUCg/viewform?usp=sf_link

Or use the event to show your interest and inform the email

https://www.facebook.com/events/580536076020896/

The course will be posted on:

http://sitestree.com/training/enrol/index.php?id=112

What will be in the course:

Important topics to learn in Graph Mining, Important questions/concerns/Resources to read to answer those questions and concerns/reading/answers/research papers/projects/code/tools on different Graph Mining Topics (by topics)/quizzes to test your knowledge and learning, a set of possible assignments/labs for you to implement and practice, some example code, example assignments/problems & solutions, example researches that are going on, potential research topics, potential project problems, example use cases.

A chat option (every evening) to chat with others on the topics and questions, a discussion forum to discuss the topics, I believe that I will answer the sincere questions in the discussion forums.

This is more of a conceptual course where a course primarily on tools, code, and implementation might be created in the future.

The course is offered under Justetc Social Services (a non-profit in Canada), 81112223 Canada Inc. (Justetc Technologies)

Sayed Ahmed

Linkedin: https://ca.linkedin.com/in/sayedjustetc

Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
Online and Offline Training: http://Training.SitesTree.com

Affiliate Links:
Hottest Deals on Amazon USA: http://tiny.cc/38lddz

Hottest Deals on Amazon CA: http://tiny.cc/bgnddz

Hottest Deals on Amazon Europe: http://tiny.cc/w4nddz



However, if you want to contribute to the operation of this site (or charitable/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com using Paypal.

Oct 14

Graph Mining: Highly Connected Subgraph Clustering: Learn by finding answers to the following questions.

Graph Mining: Highly Connected Subgraph Clustering: Learn by finding answers to the following questions.

How do you define: Highly Connected?

What is a Cluster?

What is Subgraph?

Does connectivity indicate the number of edges between clusters?

True or false: Highly connected clustering means: within a cluster, connectivity will be low. Across clusters, connectivity will be high.

True or false: Highly connected clustering means: within clusters, connectivity will be high. Across clusters, connectivity will be low.

True or false: For Highly connected clustering, it is usually assumed that there is no prior assumptions on the number of clusters in the Graph.

What are some of the core concepts/terms that are related to Highly connected clustering?

What is a Cut when it comes to Highly connected clustering?

What is a Minimum Edge Cut when it comes to Highly connected clustering?

Describe Edge Connectivity for Highly connected clustering?

Contrast Cut and Minimum Edge Cut for Highly connected clustering?

Identify is this a Cut or a Minimum Edge Cut: The edges whose removal will disconnect the Graph?

Identify is this a Cut or a Minimum Edge Cut: The minimum edges whose removal will disconnect the Graph?

Edge removal and disconnecting the Graph: Does it mean we will have two clusters?

Assuming this is True: Highly connected clustering means: within a cluster, connectivity will be high. Across clusters, connectivity will be low.
—True or false: The more edges are there in a group of vertices – the more connected they are?
—True or false: The more edges are there in a group of vertices – the more similar are the vertices?
—True or false: The more edges are there in a group of vertices – it is highly likely that they will form a highly connected cluster?
—True or false: For a group of vertices, the more edges we need to remove to create a disconnected subgraph — the more similar are the vertices

Is it a highly connected subgraph? For V vertices, the minimum edge cut contains less than V/2 edges? Why? or Why not?

Is it a highly connected subgraph? For V vertices, the minimum edge cut contains more than V/2 edges? Why? or Why not?

Is it a highly connected subgraph? Undirected and Unweighted. why or why not?
Nodes: 0 to 8
Edges: {0-1} {0-2} {0-3} {1-2} {2-3} {2-4} {3-5} {4-5} {4-6} {4-7} {4-8}
{5-6} {5-7} {5-8} {6-7} {6-8} {7-8}

What is the minimum edge cut for the above graph?

What is V/2 for the above Graph?

If EC(G) is the min-cut and V = 9, is EC(G) > V/2? If it is not, then can we call the subgraph to be highly connected?

Why we use V/2 to check for a Highly connected subgraph?

What is the maximum diameter of every single highly connected graph? Can you please explain.

What is the number of edges in a highly connected subgraph?

True or false: For highly connected subgraphs, the number of edges will be at least V^2/4?

True or false? explain: the number of edges in a highly connected subgraph is quadratic?

True or false: the number of edges in a highly connected subgraph is at most two?

Give and Describe the steps for creating/finding highly connected subgraphs.

Give the algorithm and pseudo-code Highly connected subgraphs?

What are the input and output for Highly connected subgraphs?

As we saw the definition of Min Edge Cut, can it be used in an algorithm for finding highly connected subgraphs?

As we saw that for highly connected subgraphs: EC(G) > V/2 i.e. Min Edge Cut > V/2. Can we just find min edge cuts for graphs/subgraphs that satisfy EC(G) > V/2 and divide the graph to get clusters? Also, we can do the same to the clusters to find smaller clusters if any. Can these be sufficient (core) to find highly connected subgraphs?

When will the Algorithm stop? i.e. Terminating Condition?

What are the algorithms to find the minimum edge cut for graphs?

Can you apply Karger’s algorithm for Minimum Cut to Weighted Graphs? if so, How? What was its intended purpose?

Can you apply Stoer-Wagner’s algorithm for Minimum Cut to Unweighted Graphs? if so, How? What was its intended purpose?

What is the core concept of Karger’s algorithm?

What is the “contraction of an edge” in Karger’s algorithm?

What is the number of edge reduction caused by “contraction of an edge”?

In Karger’s algorithm when you merge two nodes u and v, what happens to the edges that were previously connected to those nodes?

What is the complexity of Karger’s algorithm?

What is the complexity of Karger’s algorithm? is it O(E) or O(V) or O (Log(E))

Describe Karger’s algorithm?

Give the steps in Karger’s algorithm?

Describe Pseudo-code and Python/C++/R/Java code for Karger’s algorithm?

What is the input for Karger’s algorithm? What is the output?

What is the terminating condition for Karger’s algorithm?

Can you continue with Karger’s algorithm when there are <= 2 vertices left?

Give the minimum cut for the following Graph using Karger’s algorithm?
STEPS: while there are more than 2 vertices, pick a random edge (u, v), contract u and v into one vertex, reattach the edges of u and v to this new vertex, remove self-loops. Keep doing.
Graph, Edges: {0, 1} {0, 2} {0, 3} {1, 3} {2, 3}
Also, show all the steps in picture or text

Will Karger’s algorithm? always create Min Cut?

What is the probability that Karger’s algorithm will create Min Cut?

For a 10 node graph, is the probability = 1/100?

If Karger’s algorithm is not supposed to generate the min-cut always, how can you increase the probability of creating i.e. implement in such a way so that you increase your chances to find the min-cut before applying for Highly Connected Subgraph Clustering algorithm?

Can running the Karger’s algorithm multiple/sufficient times and then taking the least cut found so far will produce better min-cut and better highly connected clusters (than just running once)?

Some Answers:
What is the minimum edge cut for the above graph?
Ans: 2

What is V/2 for the above Graph? 4.5

If EC(G) is the min-cut and V = 9, is EC(G) > V/2? If it is not, then can we call the subgraph to be highly connected?
Ans: No, False, G is not a highly connected subgraph.
Resources

HCS clustering algorithm
https://en.wikipedia.org/wiki/HCS_clustering_algorithm

Karger’s algorithm for Minimum Cut | Set 1 (Introduction and Implementation)
https://www.geeksforgeeks.org/kargers-algorithm-for-minimum-cut-set-1-introduction-and-implementation/

By
Sayed Ahmed

Linkedin: https://ca.linkedin.com/in/sayedjustetc

Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
Online and Offline Training: http://Training.SitesTree.com

Affiliate Links:
Hottest Deals on Amazon USA: http://tiny.cc/38lddz

Hottest Deals on Amazon CA: http://tiny.cc/bgnddz

Hottest Deals on Amazon Europe: http://tiny.cc/w4nddz



Not that this site is doing any great work; However, if you want to contribute to the operation of this site (or charitable/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com using Paypal.

Oct 13

Graph Mining: Louvian Modularity: Learn by finding answers to the following questions. Can you answer the following questions?

Graph Mining: Louvian/Louvain Modularity: Learn by finding answers to the following questions. Can you answer the following questions?

I have seen both: Louvian Modularity and Louvain Modularity. I will use Louvain Modularity

What is the primary problem that Louvain Modularity solved?

Is Louvain good at detecting small communities?

What is modularity in Graphs?

What is the range of values used to show the modularity of a Graph?

What is the equation for Modularity? You can just only explain conceptually – what are the parameters/parts – how do the parameters work?

Give the algorithm for Louvain Modularity? You can just describe or you can show the steps.

Give the Pseudo-code for Louvain Modularity and implement in Python or R or C/C++?

Is Louvain Modularity easily parallelize-able or it is more sequential?

Investigate if any other algorithm is there that works like Louvain (i.e. can be an extension/modification of Louvain) that are better suited for Parallelization.

What is the first step in Louvain Algorithm?

True or False, at first step, all nodes are assigned to one community?

True or false, at first each node is assigned to it’s own community? i.e. no of vertices = no of communities

What are the two steps in Louvain Algorithm? What is the name of the steps?

What can be the terminating condition for the Louvain Algorithm?

How a node i is merged to a neighbor node/community to create a community? What is the measure used? Can you use the modularity equation as the measure to see how and to what node/community node i will merge to? Can it happen that node i will not be merged with anything though initially, you wanted to merge/assign i to another node/community?

When you will leave a node i alone without merging with a neighbor node/community? In that case, what will be the value of the modularity i.e. modularity change (i alone or i merged with a node/community)

when you try to merge node i with a neighbor node/community, do you try to assign node i to all possible neighbor node/community and calculate modularity change? If so, to which node/community i will get assigned to (describe in terms of modularity change)?

What is Modularity Optimization in Louvain modularity? Describe the steps/process for this Optimization.

What is the second step/phase for the Louvain Algorithm? What it is called? What happens here? what are the steps/process?

Is the Louvain Algorithm supervised?

Is the Louvain Algorithm fast or slow?

How many passes do the Louvain Algorithm require to create the communities?

What is the resolution limit for the Louvain Algorithm?

When the resolution limit is low, do you get more/smaller communities?

When the resolution limit is high, do you get less/larger output communities?

What is the numerical range used for the resolution limit?

Resources:
Louvain: Fast and Memory efficient. A Parallel Alternative
https://phys.org/news/2015-01-fast-problems.html

Modularity_(networks)
https://en.wikipedia.org/wiki/Modularity_(networks)

Louvain Modularity
https://en.wikipedia.org/wiki/Louvain_Modularity

Fast unfolding of communities in large networks
https://arxiv.org/pdf/0803.0476.pdf

Resolution Limit
https://en.wikipedia.org/wiki/Modularity_%28networks%29#Resolution_limit

By

Sayed Ahmed

Linkedin: https://ca.linkedin.com/in/sayedjustetc

Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
Online and Offline Training: http://Training.SitesTree.com

Not that this site is doing any great work; However, if you want to contribute to the operation of this site (or charitable/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com (Justetc Social Services) using Paypal.

Affiliate Links:
Hottest Deals on Amazon USA: http://tiny.cc/38lddz

Hottest Deals on Amazon CA: http://tiny.cc/bgnddz

Hottest Deals on Amazon Europe: http://tiny.cc/w4nddz


Oct 12

Graph Mining: Hits. Learn by finding Answers to the Following Questions. Can you answer the following questions?

Graph Mining: Hits. Learn by finding Answers to the Following Questions.

What is HITS algorithm in Graph Mining esp. for Web?

What does HITS stand for?

What is another similar Algorithm?

What are different between the PageRank algorithm and HITS?

What is the PageRank algorithm? What is the purpose?

Where and how PageRank is used?

Where and how HITS is used?

Describe HITS?

Describe the PageRank algorithm.

What are the two core concepts in HITS algorithm?

Web-pages that serves as large directories of other pages with useful information – what are they called in HITS algorithm?

Web-pages that serves to provide information on Specific topics – what are they called in the HITS algorithm?

What are HUBs in HITS algorithm? What purpose do they serve?

What are Authorities in HITS algorithm? What purpose do they serve?

Compare HITS and PageRank.

A web-page containing links to Top 1000 Universities in the world – is this a HUB or Authority in HITS?

What is the Govt. of Canada website that provides information on all Govt. Services? Is this a Hub or an Authority?

How do you measure a Good Hub?

How do you measure a Good Authority?

Can a web-page be both Hub and Authority? Can you assign both measures to a page irrespective of how good or bad?

What are the two scores that HITS assign to a web-page?

What is authority score for a web-page?

What is the hub score for a web-page?

What does hub score measure?

What does authority score measure?

What are the three matrices that are used for HITS algorithm? i.e. when you want to implement HITS algorithm.

What is a Transition Matrix in HITS?

What is a HUB vector? What does it contain initially?

What is an Authority vector? What does it contain initially?

For the graph below, provide the Initial Transition, Hub, Authority Vector/Matrices.

Directed Graph {Source, Destination}
Node: Yahoo, Amazon, Microsoft
Edges: {Yahoo, Yahoo} {Yahoo, Amazon} {Yahoo, Microsoft} {Amazon, Yahoo} {Amazon, Microsoft} {Microsoft, Amazon}

For the same graph above, explain your transition matrix?

If Transition Matrix is A, Hub Vector = h0, Authority Vector = a0.
How is Hub Score for a page is updated?, How is Authority Score for a page is updated? How long does this update happen?

The algorithm/steps as mentioned above: will the update converge to a state where Hub and Authority values will no longer change? Why, why not? if convergence does not happen what to do?

What is HITS normalization? i.e. after each iteration. Why it might be important.

Give steps/equations used for HITS normalization.

What are the two ways, you can make the HITS algorithm stop? i.e. stopping points.

True or False, Destiny of PageRank and HITS were different. What does it mean?

Can you stop the HITS algorithm after a certain number of iterations?

In real life, are HITS and PageRank used/applied for the whole graph i.e. whole Internet for example? Or majority of the times, they are applied on contextual graphs?

What are contextual graphs, anyway?

Give example use cases for HITS and PageRank?

Can you think of the value aspect of these algorithms? i.e. how they affect people, communities, societies?

What are the programming languages where you will find libraries that implement the HITS and PageRank algorithm? Give the name of the libraries.

Implement the algorithms from scratch in Python or in R without using the libraries. What did you use to debug your implementation and how?
What are the challenges that you faced to implement, how did you resolve? How did you represent the Graphs (i.e. on the graph you applied for testing).

Some Answers:
For the graph below, provide the Initial Transition, Hub, Authority Vector/Matrices.

Ans: Transition Matrix

A =[

1  1  1
1  0  1
0  1  0

]

Initial Hub Vector = h0
[
Yahoo
Amazon
Microsoft
]
=[
1
1
1]

Authority Vector: a0
[
Yahoo
Amazon
Microsoft
]

=
[
1
1
1
]

For the same graph above, explain your transition matrix?

First Row: Yahoo
2nd Row: Amazon
3rd Row: Microsoft

Columns: Yahoo —- Amazon — Microsoft

Transition Matrix

[Yahoo-> Yahoo, Yahoo-> Amazon, Yahoo-> Microsoft]
[Amazon->Yahoo, Amazon->Amazon, Amazon->Microsoft]
[Microsoft->yahoo, Microsoft->Amazon, Microsoft->microsoft]

using: 1 if page i links to page j, otherwise 0
[1,  1, 1 ]
[1,  0, 1]
[0,  1, 0]

If Transition Matrix is A, Hub Vector = h0, Authority Vector = a0.
How is Hub Score for a page is updated?, How is Authority Score for a page is updated?
A * a0 = h1 : Hub Score Update: based on authority score of outgoing links
transition(A) h1 = a1 : Authority Score Update : based on hub score of incoming links

Oct 11

Data Visualization Weekend Challenge: Go through all the resources mentioned in the following links.

Data Visualization Weekend Challenge: Go through all the resources mentioned in the following links. Learn the Concepts, and Implement/try them in a Language/Tool of your choice (also in demand). Irrespective, you go for Data Visualization Job or Go to study (Higher or not) Data Visualization – you will be very comfortable – if you know and can do it all.

Data Visualization Misc: Concepts
http://bangla.salearningschool.com/recent-posts/data-visualization-misc/

Data Visualization: BASIC CHARTS : Resources:
http://bangla.salearningschool.com/recent-posts/data-visualization-basic-charts-resources/

Visualization of Multivariate Charts
http://bangla.salearningschool.com/recent-posts/visualization-of-multivariate-charts/

GEO VISUALIZATION: Data Visualization
http://bangla.salearningschool.com/recent-posts/geo-visualization-data-visualization/

NETWORK VISUALIZATION : Data Visualization
http://bangla.salearningschool.com/recent-posts/network-visualization-data-visualization/

Hierarchical Visualization: Examples, Implementations, Theory, and Projects
http://bangla.salearningschool.com/recent-posts/hierarchical-visualization-examples-implementations-theory-and-projects/

Time Series: Concepts, Visualizations, Example Code, Example Projects
http://bangla.salearningschool.com/recent-posts/time-series-concepts-visualizations-example-code-example-projects/

PERCEPTION and Data Visualization: Concepts, Examples, Code, Projects
http://bangla.salearningschool.com/recent-posts/perception-and-data-visualization-concepts-examples-code-projects/

Text Visualization: Concepts, Examples, Code (Python, R, Matlab), Example Projects
http://bangla.salearningschool.com/recent-posts/text-visualization-concepts-examples-code-python-r-matlab-example-projects/

Data Visualization in Python (R)
http://bangla.salearningschool.com/recent-posts/data-visualization-in-python-r/

Sayed Ahmed

Linkedin: https://ca.linkedin.com/in/sayedjustetc

Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
Online and Offline Training: http://Training.SitesTree.com

Affiliate Links:
Hottest Deals on Amazon USA: http://tiny.cc/38lddz

Hottest Deals on Amazon CA: http://tiny.cc/bgnddz

Hottest Deals on Amazon Europe: http://tiny.cc/w4nddz



Not that this site is doing any great work; However, if you want to contribute to the operation of this site (or charitable/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com using Paypal.

Oct 10

Graph Mining: Introducing Graphs: Learn by finding answers to the following questions?

Graph Mining: Introducing Graphs: Learn by finding answers to the following questions?

Questions

What is a Graph?

Give an example of a Graph?

What are the different Types of Graphs? i.e. Try to give some examples of different ways how Graphs are classified?

What is a directed Graph?

What is an undirected Graph?

What are Labeled Graphs?

What are Weighted Graphs?

What are the unweighted Graphs?

What are the Bipartite Graphs?

What is a Tree?

What is a Signed Graph?

What is a Looped Graph? i.e. What is a loop?

Compare Static and Time-evolving Graphs.

What is an Isomorphic Graph?

What does Isomorphism mean when it comes to Graphs?

What are different ways to represent Graphs? i.e. when implementing Graph Algorithms?

How to store a Graph data in programming languages?

Describe the Adjacency Matrix approach of Graph Representation.

Give a small example graph then represent it using the Adjacency Matrix approach of Graph Representation.

Represent the following Graph using Adjacency Matrix approach of Graph Representation
Edges: {0, 1} {0, 4} {1, 2} {1, 3} {1, 4} {2, 3} {3, 4}

What are the advantages/pros of the Adjacency Matrix Representation?

What are the disadvantages/cons of the Adjacency Matrix Representation?

Describe the Adjacency List approach of Graph Representation.

Give a small example graph then represent it using the Adjacency List approach of Graph Representation.

Represent the following Graph using Adjacency List approach of Graph Representation
Edges: {0, 1} {0, 4} {1, 2} {1, 3} {1, 4} {2, 3} {3, 4}

What are the advantages/pros of the Adjacency List Representation?

What are the disadvantages/cons of the Adjacency List Representation?

Describe the Adjacency Tensor approach of Graph Representation.

Give a small example graph then represent it using the Adjacency Tensor approach of Graph Representation.

Represent the following Graph using Adjacency Tensor approach of Graph Representation
Edges: {0, 1} {0, 4} {1, 2} {1, 3} {1, 4} {2, 3} {3, 4}

What are the advantages/pros of Adjacency Tensor Representation?

What are the disadvantages/cons of Adjacency Tensor Representation?

True or False? Adjacency Matrix is a 2D array of size V x V where V is the number of vertices in a graph.

Can the Adjacency Matrix represent weighted graphs?

How easy it is you think to represent graphs using Adjacency Matrix?

What is the complexity of removing an edge from Adjacency Matrix representation?

What is the complexity of queries such as whether there is an edge between vertex a and b for Adjacency Matrix representation?

What is the Space complexity for Adjacency Matrix representation? Use vertex count to represent.

What is the complexity of adding an edge from Adjacency Matrix representation?

For the Adjacency List approach, how many total lists are there? How many vertices each list can have at best?

For the Adjacency List approach, how many lists are there for one vertex?

How much Space does the Adjacency List approach take?

How many elements does an Adjacency list contain for an undirected graph? Represent using E = edge count. For the complete representation of the Graph.

Why the complete representation of an undirected Graph using Adjacency List will have 2|E| number of elements?

How many times does an edge appear in the complete representation of the Undirected Graph using the Adjacency List?

Why the complete representation of the Directed Graph using Adjacency List will have |E| number of elements?

How many times does an edge appear in the complete representation of the Directed Graph using the Adjacency List?

How many dimensions will an Adjacency Tensor have for Tensor? What is this for Dynamic Graphs?

Some Answers
What are the different Types of Graphs? i.e. Try to give some examples of different ways how Graphs are classified?

Ans: Undirected vs. Directed, Attributed/Labeled (e.g., vertex, edge) vs. Unlabeled, Weighted vs. Unweighted, General vs. Bipartite (Multipartite), Signed Graphs, Trees (no cycles), Simple vs. w/ loops vs. w/ multi-edges, Static vs. Time Evolving Graphs, Isomorphic Graphs

What are the different ways to represent Graphs? i.e. when implementing Graph Algorithms?
Ans: Static Graphs, Adjacency Matrix, Adjacency List, Dynamic Graphs, Adjacency 3D Tensor

Resources:
Graph mining – lesson 1 Introduction to graphs and networks Nathalie Vialaneix
http://www.nathalievialaneix.eu/teaching/m2se/M2SE-network_1.pdf

phpFox Features: Start your own Social Network
https://www.phpfox.com/features/

Bipartite graph
https://en.wikipedia.org/wiki/Bipartite_graph

Tree (data structure)
https://en.wikipedia.org/wiki/Tree_(data_structure)

Tree structure
https://en.wikipedia.org/wiki/Tree_structure

Signed graph
https://en.wikipedia.org/wiki/Signed_graph

Gene regulatory network
https://en.wikipedia.org/wiki/Gene_regulatory_network

Dynamic Influence Analysis in Evolving Networks (VLDB’16)
https://www.slideshare.net/todo314/dynamic-influence-analysis-in-evolving-networks-vldb16

Introduction to Graph Theory
https://www.csc2.ncsu.edu/faculty/nfsamato/practical-graph-mining-with-R/slides/ppt/Introduction_to_Graph_Theory.ppt

Graph and its representations
https://www.geeksforgeeks.org/graph-and-its-representations/

Representing graphs
https://www.khanacademy.org/computing/computer-science/algorithms/graph-representation/a/representing-graphs
https://www.geeksforgeeks.org/graph-and-its-representations/

By

Sayed Ahmed

Linkedin: https://ca.linkedin.com/in/sayedjustetc

Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
Online and Offline Training: http://Training.SitesTree.com

Affiliate Links:
Hottest Deals on Amazon USA: http://tiny.cc/38lddz

Hottest Deals on Amazon CA: http://tiny.cc/bgnddz

Hottest Deals on Amazon Europe: http://tiny.cc/w4nddz



We do not claim that this site is doing any great work; However, if you want to contribute to the operation of this site (or charitable/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com using Paypal. Monthly our articles/short-notes sites usually have visitors in the range 10k to 20k.