The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Search results for "PageRank"

Algorithm::PageRank - Calculate PageRank in Perl River stage zero No dependents

This is a simple implementation of PageRank algorithm. Please do not expect it to be potent to cope with zilla-size of data. graph Feed the graph topology. Vertices count from 0. iterate Calculate the pagerank vector. The parameter is the maximal num...

XERN/Algorithm-PageRank-0.08 - 23 Aug 2004 06:34:56 UTC - Search in distribution

WWW::Google::PageRank - Query google pagerank of page River stage one • 3 direct dependents • 4 total dependents

The "WWW::Google::PageRank" is a class implementing a interface for querying google pagerank. To use it, you should create "WWW::Google::PageRank" object and use its method get(), to query page rank of URL. It uses "LWP::UserAgent" for making request...

YKAR/WWW-Google-PageRank-0.19 - 26 Aug 2016 08:03:26 UTC - Search in distribution

Algorithm::PageRank::XS - A Fast PageRank implementation River stage zero No dependents

This module implements a simple PageRank algorithm in C. The goal is to quickly get a vector that is closed to the eigenvector of the stochastic matrix of a graph. Algorithm::PageRank does some pagerank calculations, but it's slow and memory intensiv...

AXIAK/Algorithm-PageRank-XS-0.04 - 08 Dec 2008 04:29:27 UTC - Search in distribution

AnyEvent::Google::PageRank - Non-blocking wrapper for WWW::Google::PageRank River stage zero No dependents

AnyEvent::Google::PageRank helps to get google pagerank for specified url, like WWW::Google::PageRank does. But in contrast to WWW::Google::PageRank you can perform many requests in parallel. This module uses AnyEvent::HTTP as HTTP client....

OLEG/AnyEvent-Google-PageRank-0.05 - 15 Jan 2019 17:40:28 UTC - Search in distribution

Graph::Centrality::Pagerank - Computes pagerank of all nodes in a graph. River stage one • 1 direct dependent • 2 total dependents

"Graph::Centrality::Pagerank" computes the pagerank of the all nodes in a graph. The input can be a list of edges or a Graph. "Graph::Centrality::Pagerank" is written entirely in Perl and is not recommended for use in high performance applications....

KUBINA/Graph-Centrality-Pagerank-1.05 - 20 Aug 2010 18:03:32 UTC - Search in distribution

SNA::Network::Algorithm::PageRank - implementation of the PageRank algorithm River stage zero No dependents

OBRADOVIC/SNA-Network-0.21 - 29 Jan 2016 16:06:59 UTC - Search in distribution

POE::Component::IRC::Plugin::Google::PageRank - non-blocking access to Google's PageRank via IRC River stage one • 1 direct dependent • 1 total dependent

This module is a POE::Component::IRC plugin which uses POE::Component::IRC::Plugin for its base. It provides access to Google PageRank from IRC. It accepts input from public channel events, "/notice" messages as well as "/msg" (private messages); alt...

ZOFFIX/POE-Component-IRC-PluginBundle-WebDevelopment-2.001003 - 02 Feb 2014 20:22:07 UTC - Search in distribution

App::ZofCMS::Plugin::GooglePageRank - Plugin to show Google Page Ranks River stage one • 1 direct dependent • 1 total dependent

The module is a plugin for App::ZofCMS that provides means to obtain Google Page Rank. This documentation assumes you've read App::ZofCMS, App::ZofCMS::Config and App::ZofCMS::Template...

ZOFFIX/App-ZofCMS-1.001008 - 05 Dec 2019 18:55:19 UTC - Search in distribution

linkMpca - default run of MPCA on data from linkBags(1) River stage zero No dependents

Builds K components with default mpca and their ranking with mprank Requires a basic STEM to exist with .srcpar and bags already created, presuably by linkbags(1). It builds the new model with name STEM plus K. Requires files STEM.tokens, which lists...

WBUNTINE/Alvis-Bags-0.3 - 23 Feb 2007 11:44:36 UTC - Search in distribution

XML::GSA - Creates xml in google search appliance (GSA) format River stage zero No dependents

WANDERER/XML-GSA-0.07 - 11 Feb 2014 09:49:14 UTC - Search in distribution

combineRank - calculates various Ranks for a Combine crawled database River stage zero No dependents

Implements calculation of different variants of PageRank. Results are written to STDOUT and can be huge for large databases. Linkgraph is exported in ASCII as a sparse matrix, one row per line. First integer is the ID (urlid) of a page with links. Th...

AARDO/combine_4.005 - 05 Sep 2011 09:09:23 UTC - Search in distribution

Text::Categorize::Textrank::En - Find potential keywords in English text. River stage one • 1 direct dependent • 1 total dependent

"Text::Categorize::Textrank::En" provides methods for ranking the words in English text as potential keywords. It implements a version of the textrank algorithm from the report *TextRank: Bringing Order into Texts* by R. Mihalcea and P. Tarau. Encodi...

KUBINA/Text-Categorize-Textrank-0.51 - 12 Mar 2012 17:12:15 UTC - Search in distribution

Acme::CPANModules::XSVersions - List of Perl modules which have XS implementation or backend River stage one • 1 direct dependent • 1 total dependent

This list catalogs (pure-) Perl modules that have their XS counterparts ("fast versions"), usually in separate distributions so the installation of the XS version is optional. The two versions of the modules provide the same interface. When the two m...

PERLANCAR/Acme-CPANModules-XSVersions-0.004 - 05 Sep 2023 01:48:32 UTC - Search in distribution

AnyEvent::HTTP::Socks - Adds socks support for AnyEvent::HTTP River stage one • 2 direct dependents • 2 total dependents

This module adds new `socks' option to all http_* functions exported by AnyEvent::HTTP. So you can specify socks proxy for HTTP requests. This module uses IO::Socket::Socks as socks library, so any global variables like $IO::Socket::Socks::SOCKS_DEBU...

OLEG/AnyEvent-HTTP-Socks-0.05 - 22 Jan 2015 18:48:04 UTC - Search in distribution

Algorithm::HITS::Lite - HITS algorithm implementation not requiring PDL River stage zero No dependents

GUGOD/Algorithm-HITS-Lite-0.04 - 22 Apr 2007 05:28:00 UTC - Search in distribution
15 results (0.033 seconds)