PageRank | Iterative Hadoop MapReduce program to implement PageRank
kandi X-RAY | PageRank Summary
kandi X-RAY | PageRank Summary
PageRank is a Java library. PageRank has no bugs, it has no vulnerabilities and it has low support. However PageRank build file is not available. You can download it from GitHub.
PageRank - This program takes an input file which has graph data in the form of node and its adjacency lists and generates files containing nodes, their page ranks and their adjacency lists. It also generates a file which has the top ten nodes listed in descending order of their page ranks and other graph data. PageRank.java This is the driver class. It is the main class in which the iterations of map and reduce phase start. It fixes a desired convergence, initializes the initial page rank to a value = (1/no of nodes in the graph) It then read the input file and creates an intermediary input file for the first Map task. In the iterative loop, the map and reduce tasks are defined and their input and output paths provided. At the end of each iteration, calculate the convergence based on sum of convergence, No. of nodes and convergence scaling factor. If the convergence is less than the desired convergence stop the iterations. Else set the input path for the next map phase as the output path of the current reduce phase. After the iterations are over, the final output part files created by the reducer are read and sorted to list the top ten nodes with the highest page rank and other graph data such as no. of nodes, no. of edges etc is written to new file. PageRankMapper.java This class is the mapper class. It receives a nodeid as key and node information as value It emits the nodeid and the node information first. Calculate pagerank for each of the adjacent nodes. For each of the nodes in its adjacency list It emits a key value pair of (nodeid,pagerank). PageRankReducer.java This class is the reducer class. It receives a key- nodeid and a list of values. For each value in the list If it is a node, the initialize the node with this node. Else if it a pagerank value sum it up Set the pagerank in the initialized node. Finally emit a key value pair of (nodeid,node).
PageRank - This program takes an input file which has graph data in the form of node and its adjacency lists and generates files containing nodes, their page ranks and their adjacency lists. It also generates a file which has the top ten nodes listed in descending order of their page ranks and other graph data. PageRank.java This is the driver class. It is the main class in which the iterations of map and reduce phase start. It fixes a desired convergence, initializes the initial page rank to a value = (1/no of nodes in the graph) It then read the input file and creates an intermediary input file for the first Map task. In the iterative loop, the map and reduce tasks are defined and their input and output paths provided. At the end of each iteration, calculate the convergence based on sum of convergence, No. of nodes and convergence scaling factor. If the convergence is less than the desired convergence stop the iterations. Else set the input path for the next map phase as the output path of the current reduce phase. After the iterations are over, the final output part files created by the reducer are read and sorted to list the top ten nodes with the highest page rank and other graph data such as no. of nodes, no. of edges etc is written to new file. PageRankMapper.java This class is the mapper class. It receives a nodeid as key and node information as value It emits the nodeid and the node information first. Calculate pagerank for each of the adjacent nodes. For each of the nodes in its adjacency list It emits a key value pair of (nodeid,pagerank). PageRankReducer.java This class is the reducer class. It receives a key- nodeid and a list of values. For each value in the list If it is a node, the initialize the node with this node. Else if it a pagerank value sum it up Set the pagerank in the initialized node. Finally emit a key value pair of (nodeid,node).
Support
Quality
Security
License
Reuse
Support
PageRank has a low active ecosystem.
It has 0 star(s) with 0 fork(s). There are 1 watchers for this library.
It had no major release in the last 6 months.
PageRank has no issues reported. There are no pull requests.
It has a neutral sentiment in the developer community.
The latest version of PageRank is current.
Quality
PageRank has no bugs reported.
Security
PageRank has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
License
PageRank does not have a standard license declared.
Check the repository for any license declaration and review the terms closely.
Without a license, all rights are reserved, and you cannot use the library in your applications.
Reuse
PageRank releases are not available. You will need to build from source code and install.
PageRank has no build file. You will be need to create the build yourself to build the component from source.
Top functions reviewed by kandi - BETA
kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of PageRank
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of PageRank
PageRank Key Features
No Key Features are available at this moment for PageRank.
PageRank Examples and Code Snippets
No Code Snippets are available at this moment for PageRank.
Community Discussions
No Community Discussions are available at this moment for PageRank.Refer to stack overflow page for discussions.
Community Discussions, Code Snippets contain sources that include Stack Exchange Network
Vulnerabilities
No vulnerabilities reported
Install PageRank
You can download it from GitHub.
You can use PageRank like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the PageRank component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer maven.apache.org. For Gradle installation, please refer gradle.org .
You can use PageRank like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the PageRank component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer maven.apache.org. For Gradle installation, please refer gradle.org .
Support
For any new features, suggestions and bugs create an issue on GitHub.
If you have any questions check and ask questions on community page Stack Overflow .
Find more information at:
Reuse Trending Solutions
Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items
Find more librariesStay Updated
Subscribe to our newsletter for trending solutions and developer bootcamps
Share this Page