Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/5337
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rawat, Ashish | - |
dc.contributor.author | Saha, Suman [Guided by] | - |
dc.date.accessioned | 2022-07-29T10:23:05Z | - |
dc.date.available | 2022-07-29T10:23:05Z | - |
dc.date.issued | 2015 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui//xmlui/handle/123456789/5337 | - |
dc.description.abstract | The dimension of World Wide Web (The Internet) is in billions in terms of web pages and increasing rapidly. With the diversity of web pages available on the web, the high degree relevant information retrieval becomes a major issue. Such huge number of pages not only make the computation complex but also raises the issues of fault tolerance and time complexity. Computing ranking for such large number of web graph on a particular system, makes it prone to system failure and time taking. The present work proposes a distributed ranking system to attain fault tolerance and speedy calculation of Pagerank vector. The computation of rank vector is performed by implementing Pagerank on Mapreduce framework. The pagerank vector is calculated via spectral analysis to make the computation even faster and the results are compared to traditional pagerank scores. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Web mining | en_US |
dc.subject | Web graph | en_US |
dc.subject | MapReduce | en_US |
dc.subject | Hyperlink induced topic search | en_US |
dc.subject | Cloud computing | en_US |
dc.title | Web Mining in Cloud Computing Framework RANKING | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | Dissertations (M.Tech.) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Web Mining in Cloud Computing Framework RANKING.pdf | 1.03 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.