Search engines, web crawling and web graph: Difference between revisions
Mr. MacKenty (talk | contribs) (Created page with "right|frame|Web Science<ref>http://www.flaticon.com/</ref> Please reference Principles of searching algorithms used by search engines as you refle...") |
Mr. MacKenty (talk | contribs) No edit summary |
||
| Line 6: | Line 6: | ||
Of course, computers don't use a visual directed graph. They probably use an adjacency matrix to calculate related nodes and number of relations. | Of course, computers don't use a visual directed graph. They probably use an adjacency matrix to calculate related nodes and number of relations. | ||
Please [https://youtu.be/9C2cpQZVRBA | Please [https://youtu.be/9C2cpQZVRBA watch this excellent video to better understand adjacency matrix]. | ||
Revision as of 10:29, 22 January 2018
Web Science[1]
Please reference Principles of searching algorithms used by search engines as you reflect on the learning standard, below.
Once we have a graph which describes the relationship between nodes, we can use that data to rank pages based on the number of links. PageRank works this way, but is much more complicated.
Of course, computers don't use a visual directed graph. They probably use an adjacency matrix to calculate related nodes and number of relations. Please watch this excellent video to better understand adjacency matrix.
Do you understand this?[edit]
From the IB: Students should be aware of the Page Rank algorithm and explain how it works.
Standards[edit]
These standards are used from the IB Computer Science Subject Guide[2]
- Explain that search engines and web crawling use the web graph to access information.
References[edit]
- ↑ http://www.flaticon.com/
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.