Googleov algoritam za rangiranje web stranica i njegov značaj za mrežne stranice restorana i lanaca restorana
Autor: | Mišetić, Luka |
---|---|
Přispěvatelé: | Šimunić, Mislav |
Jazyk: | chorvatština |
Rok vydání: | 2021 |
Předmět: | |
Popis: | PageRank algoritam je sastavni element Google web-pretraživača. Njegova uloga je takva da određuje važnost neke stranice, tj., on je prema svojem rangiranju važnosti postavlja na određenu poziciju u ukupnim rezultatima pretraživanja prema nekom zadanom pojmu. Algoritam se temelji na primarnoj ideji da je stranica važna ukoliko postoje poveznice na nju sa nekih drugih važnih stranica. To se može promatrati i kao glasovanje, odnosno koliko svaka pojedina poveznica ima glasova te kolika je ukupna važnost neke stranice. Drugim riječima, rezultati PageRank algoritma mogu se shvatiti kao rezultati izbora. Predmet istraživanja ovog diplomskog rada je analiza Google Page Rank algoritma i njegovog značaja za web site-ove restorana i lanaca restorana. Radom je dokazana glavna hipoteza: „Google Page Rank algoritam predstavlja važan alat jer relevantnost web stranice određuje na temelju relevantnosti web stranica koje imaju linkove na promatranu stranicu.“ Metoda kojom se Google koristi prilikom izračuna PageRank algoritma je metoda potencija. Za one veće domene ili Internet u cjelini, to je možda i jedina logična metoda. Sve ostale metode predstavljaju prevelike memorijske zahtjeve dok metoda potencija obavlja samo 50-100 matričnih množenja. Google-ov algoritam PageRank donio je revoluciju u algoritme prema kojima se rangira internet pretraživače uvođenjem analize linka kao glavnog čimbenika rangiranja. Osnovna ideja je korištenje linkova na web-stranice kao glasova, odnosno web stranica s više ulaznih linkova se smatraju važnijima. Bez obzira što je metoda potencija relativno stara i ponekad nekorisna metoda, Google je koristi za izračunavanje zbog toga što ne zahtijeva cijelu nemodificiranu matricu, već samo jedan vektor. PageRank Algorithm is a component of Google Web Browser. Its role is such that it determines the importance of a page, ie, it places its ranking of importance in a certain position in the overall search results according to a given term. The algorithm is based on the primary idea that the site is important if there are links to it from some other important sites. This can be seen both as a vote, or how each individual link has a voice, and what is the total importance of a page. In other words, the PageRank algorithm results can be understood as the results of the choice. The subject of this graduate thesis is the analysis of the Google Page Rank algorithm and its relevance to web site restaurants and restaurant chains. The paper has proven the main hypothesis: "The Google Page Rank algorithm is an important tool because the relevance of a website is determined by the relevance of websites that have links to the monitored site." The method used by Google when calculating the PageRank algorithm is a potency method. For those larger domains or the Internet as a whole, this is perhaps the only logical method. All other methods represent excessive memory requirements, while the power method performs only 50-100 matrix multipliers. Google's PageRank algorithm has revolutionized algorithms by ranking Internet browsers by introducing link analysis as the main ranking factor. The basic idea is to use links on web pages as voices, or websites with multiple inbound links are considered more important. No matter how the potency method is a relatively old and sometimes useless method, Google is used to compute because it does not require a whole unmodified matrix, but only one vector. |
Databáze: | OpenAIRE |
Externí odkaz: |