Mikael Onsjö

According to our database, Mikael Onsjö authored at least 10 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The hypergeometric test performs comparably to TF-IDF on standard text analysis tasks.

Paul Sheridan, Mikael Onsjö

Multim. Tools Appl., March, 2024

2020

A hypergeometric test interpretation of a common tf-idf variant.

Paul Sheridan, Mikael Onsjö

CoRR, 2020

2019

An Ontology-Based Recommender System with an Application to the Star Trek Television Franchise.

Paul Sheridan, Mikael Onsjö, Claudia Jeanneth Becerra, Sergio Jiménez, George Dueñas

Future Internet, 2019

The Literary Theme Ontology for Media Annotation and Information Retrieval.

Paul Sheridan, Mikael Onsjö, Janna Hastings

Proceedings of the Joint Ontology Workshops 2019 Episode V: The Styrian Autumn of Ontology, 2019

2018

A Knowledge-based Filtering Story Recommender System for Theme Lovers with an Application to the Star Trek Television Franchise.

Paul Sheridan, Mikael Onsjö, Sergio Jiménez, George Dueñas

CoRR, 2018

2010

Propagation Connectivity of Random Hypergraphs.

Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe

Proceedings of the Approximation, 2010

2009

Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions.

Mikael Onsjö, Osamu Watanabe

Theory Comput. Syst., 2009

Propagation Connectivity of Random Hypergraphs.

Robert Berke, Mikael Onsjö

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2007

Finding Most Likely Solutions.

Osamu Watanabe, Mikael Onsjö

Proceedings of the Computation and Logic in the Real World, 2007

2006

A Simple Message Passing Algorithm for Graph Partitioning Problems.

Mikael Onsjö, Osamu Watanabe

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006