Jouni Järvinen

Orcid: 0000-0002-8729-8633

According to our database1, Jouni Järvinen authored at least 46 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nelson algebras, residuated lattices and rough sets: A survey.
J. Appl. Non Class. Logics, July, 2024

Relational correspondences for L-fuzzy rough approximations defined on De Morgan Heyting algebras.
Soft Comput., January, 2024

2023
Pseudo-Kleene algebras determined by rough sets.
Int. J. Approx. Reason., October, 2023

2021
Defining rough sets as core-support pairs of three-valued functions.
Int. J. Approx. Reason., 2021

2020
The Structure of Multigranular Rough Sets.
Fundam. Informaticae, 2020

2019
Defining rough sets using tolerances compatible with an equivalence.
Inf. Sci., 2019

Rough Sets Defined by Multiple Relations.
Proceedings of the Rough Sets - International Joint Conference, 2019

2016
Representing regular Kleene algebras by tolerance-based rough sets.
CoRR, 2016

2015
Tolerances Induced by Irredundant Coverings.
Fundam. Informaticae, 2015

2014
Rough sets determined by tolerances.
Int. J. Approx. Reason., 2014

Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
Int. J. Approx. Reason., 2014

Characterizing intermediate tense logics in terms of Galois connections.
Log. J. IGPL, 2014

Monteiro Spaces and Rough Sets Determined by Quasiorder Relations: Models for Nelson algebras.
Fundam. Informaticae, 2014

2013
Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders.
Stud Logica, 2013

Intuitionistic modal logic with a galois connection has the finite model property<sup>1</sup>.
Log. J. IGPL, 2013

2010
Intuitionistic propositional logic with Galois connections.
Log. J. IGPL, 2010

2009
Rough Sets Determined by Quasiorders.
Order, 2009

An efficient algorithm for learning to rank from preference graphs.
Mach. Learn., 2009

Matrix representations, linear transformations, and kernels for disambiguation in natural language.
Mach. Learn., 2009

2008
Logics from Galois connections.
Int. J. Approx. Reason., 2008

2007
Determining the Proper Number and Price of Software Licenses.
IEEE Trans. Software Eng., 2007

Lattice Theory for Rough Sets.
Trans. Rough Sets, 2007

Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points.
Fundam. Informaticae, 2007

Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies.
Fundam. Informaticae, 2007

A unifying study between modal-like operators, topologies and fuzzy sets.
Fuzzy Sets Syst., 2007

BioInfer: a corpus for information extraction in the biomedical domain.
BMC Bioinform., 2007

Set Operations for <i>L</i> -Fuzzy Sets.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

2006
Incomplete Information: Structure, Inference, Complexity.
Stud Logica, 2006

Evaluation of two dependency parsers on biomedical corpus targeted at protein-protein interactions.
Int. J. Medical Informatics, 2006

2005
Properties of Rough Approximations.
J. Adv. Comput. Intell. Intell. Informatics, 2005

Contextual weighting for Support Vector Machines in literature mining: an application to gene versus protein name disambiguation.
BMC Bioinform., 2005

Kernels Incorporating Word Positional Information in Natural Language Disambiguation Tasks.
Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

Relational Correspondences for Lattices with Operators.
Proceedings of the Relational Methods in Computer Science, 2005

2004
New Techniques for Disambiguation in Natural Language and Their Application to Biological Text.
J. Mach. Learn. Res., 2004

Ontology-Based Feature Transformations: A Data-Driven Approach.
Proceedings of the Advances in Natural Language Processing, 4th International Conference, 2004

The Ordered Set of Rough Sets.
Proceedings of the Rough Sets and Current Trends in Computing, 2004

Extracting Protein-Protein Interaction Sentences by Applying Rough Set Data Analysis.
Proceedings of the Rough Sets and Current Trends in Computing, 2004

Analysis of Link Grammar on Biomedical Dependency Corpus Targeted at Protein-Protein Interactions.
Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications, 2004

2002
On the Structure of Rough Approximations.
Fundam. Informaticae, 2002

2001
Dense Families and Key Functions of Database Relation Instances.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Armstrong Systems on Ordered Sets.
Proceedings of the Combinatorics, 2001

2000
Two exercises.
SIGACT News, 2000

Difference Functions of Dependence Spaces.
Acta Cybern., 2000

Approximations and Rough Sets Based on Tolerances.
Proceedings of the Rough Sets and Current Trends in Computing, 2000

1998
Preimage Relations and Their Matrices.
Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997
A Representation of Dependence Spaces and Some Basic Algorithms.
Fundam. Informaticae, 1997


  Loading...