Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
16
datasets available to search
ShareScore release 0.9.0
Dataset results
16 results for “Page Rank”
Figure 2. Ranking datasets by Page Rank-Data Conflict Resolution among Same Entities in Web of Data
<p>As depicted in Figure 2 DBpedia is the top ranked data set while GeoLinked Data and<br> Eurostat are the low ranked data sets. In this stage the data sets whose rank scores are less than half<br> of the rank scores belonging to the top ranked data set are removed from the assessment.</p>
Figure 9. Experimental Page Rank dependency on Markov Chain length with balanced distribution-Study of a Random Navigation on the Web Using Software Simulation
<p>This paper explored different implementation choices for analyzing the most important<br> parameters about a web. Many researchers explored the use of new search engines for studying the<br> evolution of the web (Ntoulas, Cho and Olston, 2004). Another important research is realized about<br> the Link Structure Graph (LSG). The LSG captures a complete hyperlink structure from the web<br> and models link associations reflected in the page layout (Rodrigues, Milic-Frayling and Fortuna,<br> 2007). For further works ideas like extrapolation methods for accelerating page rank calculation can<br> be developed (Kamvar et al., 2003).</p>
Figure 7. Experimental Page Rank dependency on Markov Chain length-Study of a Random Navigation on the Web Using Software Simulation
<p>The next diagram proves that the values for Experimental Page Rank depend on the length<br> of the Markov Chain, while Algorithmic Page Rank remains constant.</p>
Fig. 8. Algorithmic Page Rank-Study of a Random Navigation on the Web Using Software Simulation
<p>Another diagram shows that for each site there is only one constant value independent of the<br> length of Markov Chain. Algorithmic Page Rank only depends on the number of inlinks and<br> outlinks.Table 4 contains the values for Experimental Page Rank with balanced distribution. In the<br> following figure it is shown the diagram for the values obtained for Experimental Page Rank.<br> The Experimental Page Rank values oscillate between the same limits independently of the<br> change of Markov Chain length (N).</p>
KGloVe DBpedia Page Rank frequency embeddings
<p>This dataset contains the vectors from computing KGloVe embeddings from a Page Rank frequency weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Global RDF Vector Space Embeddings. In The Semantic Web – ISWC 2017: 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I.</p>
RDF2Vec DBpedia Page Rank split embeddings
<p>This dataset contains the vectors from computing RDF2vec embeddings from a Page Rank split weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Biased graph walks for RDF graph embeddings. In Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics (WIMS '17). ACM, New York, NY, USA, Article 21, 12 pages. DOI: https://doi.org/10.1145/3102254.3102279</p>
KGloVe DBpedia inverse Page Rank split embeddings
<p>This dataset contains the vectors from computing KGloVe embeddings from a inverse Page Rank split weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Global RDF Vector Space Embeddings. In The Semantic Web – ISWC 2017: 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I.</p>
KGloVe DBpedia Page Rank split frequency embeddings
<p>This dataset contains the vectors from computing KGloVe embeddings from a Page Rank split frequency weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Global RDF Vector Space Embeddings. In The Semantic Web – ISWC 2017: 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I.</p>
KGloVe DBpedia inverse Page Rank embeddings
<p>This dataset contains the vectors from computing KGloVe embeddings from a inverse Page Rank weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Global RDF Vector Space Embeddings. In The Semantic Web – ISWC 2017: 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I.</p>
RDF2Vec DBpedia Page Rank embeddings
<p>This dataset contains the vectors from computing RDF2vec embeddings from a Page Rank weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Biased graph walks for RDF graph embeddings. In Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics (WIMS '17). ACM, New York, NY, USA, Article 21, 12 pages. DOI: https://doi.org/10.1145/3102254.3102279<br> </p>
RDF2Vec DBpedia inverse page rank split embeddings
<p>This dataset contains the vectors from computing RDF2vec embeddings from a inverse page rank split weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Biased graph walks for RDF graph embeddings. In Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics (WIMS '17). ACM, New York, NY, USA, Article 21, 12 pages. DOI: https://doi.org/10.1145/3102254.3102279</p>
RDF2Vec DBpedia inverse Page Rank frequency embeddings
<p>This dataset contains the vectors from computing RDF2vec embeddings from a inverse Page Rank frequency weighted DBpedia 2016-04 graph.</p> <p>For each entity in the graph, the text file in the zip archive contains a line with the entity name and the embedded vector.</p> <p>The parameter settings for the embedding are as specified in the paper:</p> <p>Michael Cochez, Petar Ristoski, Simone Paolo Ponzetto, and Heiko Paulheim. 2017. Biased graph walks for RDF graph embeddings. In Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics (WIMS '17). ACM, New York, NY, USA, Article 21, 12 pages. DOI: https://doi.org/10.1145/3102254.3102279</p>
A Novel Algorithm for Estimating Web Page Ranking in Search Engine Results Pages
<p><em><strong>Abstract:</strong> </em>Search engine optimization (SEO) can make a big improvement in the traffic to a web page. Because search engines keep their main rules of ranking undeclared, it’s important to develop models that can estimate the ranking of a web page in the search engine to be able to optimize web pages to rank higher in the search engine. The available research methodologies used machine learning algorithms to provide solutions for this target with the help of generated datasets by scraping the search engine results pages (SERP) and crawling web pages. Their proposed models suffered from the inability to be updated dynamically if the search engine updated its ranking algorithm, and their input data did not include the diversity of web pages and languages. This research will propose a novel original rank estimation algorithm that’s able to overcome other research challenges, with a set of comparative experiments and complexity analysis. Results will show that the proposed algorithm could achieve higher values of accuracy, precision, and recall.</p> <p><strong><em>Dataset: </em></strong></p> <p>For research purpose, the dataset will play two roles, first, it will act the role of search engine result pages (SERP), and second, it will be used to test algorithms and calculate performance measurements. Dataset is consisting of 9930 web pages, aimed to identify search results pages, focusing on the top 3 pages of SERP, with 31 extracted attributes that's related to search engine optimization (SEO). The distribution of examples between class labels was balanced, with changes due to scraping operation issues, but not significantly different, with fractions of 39.9%, 34.6%, and 25.5% for the class labels page1, page2, and page 3. Feature names are: 'Title 1 Length', 'Title 2 Length', 'Meta Description 1 Length', 'Meta Description 2 Length', 'Meta Keywords 1 Length', 'H1-1 Length', 'H1-2 Length', 'H2-1 Length', 'H2-2 Length', 'Size (bytes)', 'Word Count', 'Text Ratio', 'Inlinks', 'Unique Inlinks', 'Unique JS Inlinks', '% of Total', 'Outlinks', 'Unique Outlinks', 'Unique JS Outlinks', 'External Outlinks', 'Unique External Outlinks', 'Unique External JS Outlinks', 'Response Time', 'Status Code', 'Keyword in MetaDescription1', 'Keyword in Title1', 'Keyword in MetaKeywords1', 'Keyword in URL', 'Has LastModified', 'Keyword in Headers', and 'Keyword in Emphasized Text'.</p> <p>The process of dataset generation involved scraping the search engine, extracting URLs for selected keywords, focusing on feature extraction, cleaning and preprocessing, and generating new attributes related to keywords in web pages. It involved also removing missing values, duplicates, and data type conversions to obtain a comprehensive dataset.<br> Keyword selection involves selecting keywords from various categories and considering diversity, including high and low traffic, long-term and short-term keywords, and generic and branded keywords. Apify online tool was used for search engine scraping with default language and US country, resulting in 388 selected keywords with 30 results per keyword. Dataset included extracted SEO features from 9991 web pages using screamingFrog desktop software and Rapidminer desktop software, determining page SEO-friendliness and comparing it to SERP rankings. Dataset cleaning involved removing redundant attributes, removing paid SERP results, replacing missing values, and converting data types. Rapidminer was used for data cleaning and preprocessing, generating new attributes related to keyword usage in web pages.<br> </p>
Figure 2 from: Doran M, Barnett A, Leach J, Lott W, Page K, Grant W (2017) Can video improve grant review quality and lead to more reliable ranking? Research Ideas and Outcomes 3: e11931. https://doi.org/10.3897/rio.3.e11931
Figure 2 - Applicants' estimation of how a PowerPoint video would assist the grant prepration and review process.
Figure 1 from: Doran M, Barnett A, Leach J, Lott W, Page K, Grant W (2017) Can video improve grant review quality and lead to more reliable ranking? Research Ideas and Outcomes 3: e11931. https://doi.org/10.3897/rio.3.e11931
Figure 1 - Applicants' estimated time required to either write a text-based or video project proposal.
Figure 1 from: Chakrabarty P, Warren M, Page L (2013) GenSeq: An updated nomenclature and ranking for genetic sequences from type and non-type sources. ZooKeys 346: 29-41. https://doi.org/10.3897/zookeys.346.5753
Figure 1 - Example of how the GenSeq ranking system of sequences from various sources (Table 1) can be used to assess the trustworthiness of data used to reconstruct phylogenetic relationships. The rankings (the # in the "genseq-#") make it clear that the relationship recovered between Species 3 and Species 4, from primary and secondary types, should be trustworthy because the taxonomic identifications of the voucher specimens are considered to be highly reliable. In contrast, the recovered sister relationship between Species 1 and Species 2 may be less trustworthy because of the weak reliability rankings of these sequences from non-types. Species 1 lacks both a specimen or photo voucher and therefore does not have a GenSeq ranking.
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.