Verwandte Artikel zu Discrete Characteristic Probability Distribution Theorem:...
Inhaltsangabe
As internet has become a crucial element of Information Technology in our daily lives, so has the web search engine. Web search engines are formed with the reason to search information from the World Wide Web (WWW). This work proposes a new approach to rank web pages for search engines. This new method is an alternative to PageRank algorithm. It starts off by discussing in brief about the algorithm of PageRank, the mathematical background of PageRank and its role to rank web pages. Next, the book introduces a new method and formula to find the probability that can be used to rank web pages efficiently. The derivation of formula and how it is found is explained in details. The proposed methodology shows how it is not only dependent on backward link while ranking webpages. It also considers other entities of a webpage to rank a webpage. The data and results for this research are presented to prove how the new probability formula derived is efficient to overcome the backward overloading problem of PageRank.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
As internet has become a crucial element of Information Technology in our daily lives, so has the web search engine. Web search engines are formed with the reason to search information from the World Wide Web (WWW). This work proposes a new approach to rank web pages for search engines. This new method is an alternative to PageRank algorithm. It starts off by discussing in brief about the algorithm of PageRank, the mathematical background of PageRank and its role to rank web pages. Next, the book introduces a new method and formula to find the probability that can be used to rank web pages efficiently. The derivation of formula and how it is found is explained in details. The proposed methodology shows how it is not only dependent on backward link while ranking webpages. It also considers other entities of a webpage to rank a webpage. The data and results for this research are presented to prove how the new probability formula derived is efficient to overcome the backward overloading problem of PageRank.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 38,74
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Discrete Characteristic Probability Distribution Theorem:...
Foto des Verkäufers
Discrete Characteristic Probability Distribution Theorem
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chowdhury Adib KabirAdib Kabir Chowdhury has obtained his BTech (Computer Systems & Networking) and MPhil. (Electrical & Computer Engineering) degree from Curtin University, Sarawak, Malaysia. Currently he is working as a Lecturer in. Bestandsnummer des Verkäufers 17682744
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Discrete Characteristic Probability Distribution Theorem
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -As internet has become a crucial element of Information Technology in our daily lives, so has the web search engine. Web search engines are formed with the reason to search information from the World Wide Web (WWW). This work proposes a new approach to rank web pages for search engines. This new method is an alternative to PageRank algorithm. It starts off by discussing in brief about the algorithm of PageRank, the mathematical background of PageRank and its role to rank web pages. Next, the book introduces a new method and formula to find the probability that can be used to rank web pages efficiently. The derivation of formula and how it is found is explained in details. The proposed methodology shows how it is not only dependent on backward link while ranking webpages. It also considers other entities of a webpage to rank a webpage. The data and results for this research are presented to prove how the new probability formula derived is efficient to overcome the backward overloading problem of PageRank. 72 pp. Englisch. Bestandsnummer des Verkäufers 9783639515701
Anzahl: 2 verfügbar
Foto des Verkäufers
Discrete Characteristic Probability Distribution Theorem : Efficient Web Page Ranking
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - As internet has become a crucial element of Information Technology in our daily lives, so has the web search engine. Web search engines are formed with the reason to search information from the World Wide Web (WWW). This work proposes a new approach to rank web pages for search engines. This new method is an alternative to PageRank algorithm. It starts off by discussing in brief about the algorithm of PageRank, the mathematical background of PageRank and its role to rank web pages. Next, the book introduces a new method and formula to find the probability that can be used to rank web pages efficiently. The derivation of formula and how it is found is explained in details. The proposed methodology shows how it is not only dependent on backward link while ranking webpages. It also considers other entities of a webpage to rank a webpage. The data and results for this research are presented to prove how the new probability formula derived is efficient to overcome the backward overloading problem of PageRank. Bestandsnummer des Verkäufers 9783639515701
Anzahl: 1 verfügbar
Foto des Verkäufers
Discrete Characteristic Probability Distribution Theorem
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -As internet has become a crucial element of Information Technology in our daily lives, so has the web search engine. Web search engines are formed with the reason to search information from the World Wide Web (WWW). This work proposes a new approach to rank web pages for search engines. This new method is an alternative to PageRank algorithm. It starts off by discussing in brief about the algorithm of PageRank, the mathematical background of PageRank and its role to rank web pages. Next, the book introduces a new method and formula to find the probability that can be used to rank web pages efficiently. The derivation of formula and how it is found is explained in details. The proposed methodology shows how it is not only dependent on backward link while ranking webpages. It also considers other entities of a webpage to rank a webpage. The data and results for this research are presented to prove how the new probability formula derived is efficient to overcome the backward overloading problem of PageRank.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch. Bestandsnummer des Verkäufers 9783639515701
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Discrete Characteristic Probability Distribution Theorem
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 72. Bestandsnummer des Verkäufers 26374048750
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Discrete Characteristic Probability Distribution Theorem
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 72. Bestandsnummer des Verkäufers 18374048740
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Discrete Characteristic Probability Distribution Theorem
Print-on-DemandAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Print on Demand pp. 72. Bestandsnummer des Verkäufers 373045297
Anzahl: 4 verfügbar