default search action
Paul Sheridan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Paul Sheridan
, Mikael Onsjö:
The hypergeometric test performs comparably to TF-IDF on standard text analysis tasks. Multim. Tools Appl. 83(10): 28875-28890 (2024) - 2023
- [i8]Samuel Sarria Hurtado, Todd Mullen, Taku Onodera, Paul Sheridan
A statistical significance testing approach for measuring term burstiness with applications to domain-specific terminology extraction. CoRR abs/2310.15790 (2023) - [i7]Uyen Lai, Gurjit S. Randhawa, Paul Sheridan
Heaps' Law in GPT-Neo Large Language Model Emulated Corpora. CoRR abs/2311.06377 (2023) - 2021
- [j2]Thong Pham
Non-parametric estimation of the preferential attachment function from one network snapshot. J. Complex Networks 9(5) (2021) - [i6]Thong Pham, Paul Sheridan, Hidetoshi Shimodaira:
Nonparametric estimation of the preferential attachment function from one network snapshot. CoRR abs/2103.01750 (2021) - 2020
- [i5]Paul Sheridan, Mikael Onsjö:
A hypergeometric test interpretation of a common tf-idf variant. CoRR abs/2002.11844 (2020)
2010 – 2019
- 2019
- [j1]Paul Sheridan
An Ontology-Based Recommender System with an Application to the Star Trek Television Franchise. Future Internet 11(9): 182 (2019) - [c3]Paul Sheridan, Mikael Onsjö, Janna Hastings:
The Literary Theme Ontology for Media Annotation and Information Retrieval. JOWO 2019 - [i4]Paul Sheridan, Mikael Onsjö, Janna Hastings:
The Literary Theme Ontology for Media Annotation and Information Retrieval. CoRR abs/1905.00522 (2019) - 2018
- [i3]Paul Sheridan, Mikael Onsjö, Sergio Jiménez, George Dueñas:
A Knowledge-based Filtering Story Recommender System for Theme Lovers with an Application to the Star Trek Television Franchise. CoRR abs/1808.00103 (2018) - 2017
- [i2]Paul Sheridan, Taku Onodera:
A Preferential Attachment Paradox: How does Preferential Attachment Combine with Growth to Produce Networks with Log-normal In-degree Distributions? CoRR abs/1703.06645 (2017) - [i1]Thong Pham, Paul Sheridan, Hidetoshi Shimodaira:
PAFit: An R Package for Modeling and Estimating Preferential Attachment and Node Fitness in Temporal Complex Networks. CoRR abs/1704.06017 (2017) - 2014
- [c2]Thong Pham
Nonparametric Estimation of the Preferential Attachment Function in Complex Networks: Evidence of Deviations from Log Linearity. ECCS 2014: 141-153
2000 – 2009
- 2009
- [c1]Paul Sheridan, Takeshi Kamimura, Hidetoshi Shimodaira
On Scale-Free Prior Distributions and Their Applicability in Large-Scale Network Inference with Gaussian Graphical Models. Complex (1) 2009: 110-117
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: