J. Järvinen, S. Radeleczki: The structure of rough sets defined by reflexive relations, International Journal of Approximate Reasoning 185 (2025) Article ID 109471, 20 p. doi: 10.1016/j.ijar.2025.109471

J. Järvinen, S. Radeleczki, U. Rivieccio: Nelson algebras, residuated lattices and rough sets. A survey, Journal of Applied Non-Classical Logics 34 (2024) 368–428. doi: 10.1080/11663081.2024.2336386

J. Järvinen, M. Kondo: Relational correspondences for L-fuzzy rough approximations defined on De Morgan Heyting algebras, Soft Computing 28 (2024) 903–916. doi: 10.1007/s00500-023-09444-7

J. Järvinen, S. Radeleczki: Pseudo-Kleene algebras determined by rough sets, International Journal of Approximate Reasoning 161 (2023) Article ID 108991, 22 p. doi: 10.1016/j.ijar.2023.108991

J. Järvinen, S. Radeleczki: Defining rough sets as core–support pairs of three-valued functions, International Journal of Approximate Reasoning 135 (2021) 71–90. doi: 10.1016/j.ijar.2021.05.002

J. Järvinen, S. Radeleczki: The structure of multigranular rough sets, Fundamenta Informaticae 176 (2020) 17–41. doi: 10.3233/FI-2020-1961

J. Järvinen, S. Radeleczki: Prime filter structures of pseudocomplemented Kleene algebras and representation by rough sets, Acta Mathematica Hungarica 160 (2020) 175–196. doi: 10.1007/s10474-019-00985-8

J. Järvinen, L. Kovács, S. Radeleczki: Rough sets defined by multiple relations, Lecture Notes in Computer Science 11499 (2019) 40–51. doi: 10.1007/978-3-030-22815-6_4

J. Järvinen, L. Kovács, S. Radeleczki: Defining rough sets using tolerances compatible with an equivalence, Information Sciences 496 (2019) 264–283. doi: 10.1016/j.ins.2019.05.030

J. Järvinen, S. Radeleczki: Irredundant Coverings, Tolerances, and Related Algebras.  Book chapter in A. Mani, G. Cattaneo, I. Düntsch (eds.), Algebraic Methods in General Rough Sets, Trends in Mathematics, Birkhäuser, Cham, 2018, pages 417–457. doi: 10.1007/978-3-030-01162-8_5

J. Järvinen, S. Radeleczki: Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets, Journal of the Australian Mathematical Society 105 (2018) 57–78. doi: 10.1017/S1446788717000283

J. Järvinen, S. Radeleczki: Tolerances induced by irredundant coverings, Fundamenta Informaticae 137 (2015) 341–353. doi: 10.3233/FI-2015-1183

W. Dzik, J. Järvinen, M. Kondo: Characterizing intermediate tense logics in terms of Galois connections, Logic Journal of the IGPL 22 (2014) 992–1018. doi: 10.1093/jigpal/jzu024

J. Järvinen, S. Radeleczki: Monteiro spaces and rough sets determined by quasiorder relations: Models for Nelson algebras, Fundamenta Informaticae 131 (2014) 205–215. doi: 10.3233/FI-2014-1010

W. Dzik, J. Järvinen, M. Kondo: Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets, International Journal of Approximate Reasoning 55 (2014) 427–435. doi: 10.1016/j.ijar.2013.07.005

J. Järvinen, S. Radeleczki: Rough sets determined by tolerances, International Journal of Approximate Reasoning 55 (2014) 1419–1438. doi: 10.1016/j.ijar.2013.12.005

J. Järvinen, M. Kondo, J. K. Mattila, S. Radeleczki, Hidden modalities in algebras with negation and implication, Mathematics for applications 2 (2013) 5–20. doi: 10.13164/ma.2013.02

J. Järvinen, P. Pagliani, S. Radeleczki: Information completeness in Nelson algebras of rough sets induced by quasiorders, Studia Logica 101 (2013) 1073–1092. doi: 10.1007/s11225-012-9421-z 

W. Dzik, J. Järvinen, M. Kondo: Intuitionistic modal logic with a Galois connection has the finite model property, Logic Journal of the IGPL 21 (2013) 199–204. doi: 10.1093/jigpal/jzs016

J. Järvinen, S. Radeleczki: Representation of Nelson algebras by rough sets determined by quasiorders, Algebra Universalis 66 (2011) 163–179. doi: 10.1007/s00012-011-0149-9

W. Dzik, J. Järvinen, M. Kondo: Intuitionistic propositional logic with Galois connections, Logic Journal of the IGPL 18 (2010) 837–858. doi: 10.1093/jigpal/jzp057

T. Pahikkala, E. Tsivtsivadze, A. Airola, J. Järvinen, J. Boberg: An efficient algorithm for learning to rank from preference graphs, Machine Learning 75 (2009) 129−165. doi: 10.1007/s10994-008-5097-z

T. Pahikkala, S. Pyysalo, J. Boberg, J. Järvinen, T. Salakoski: Matrix representations, linear transformations, and kernels for disambiguation in natural language, Machine Learning 74 (2009) 133–158 . doi: 10.1007/s10994-008-5082-6

J. Järvinen, S. Radeleczki, L. Veres: Rough sets determined by quasiorders, Order 26 (2009) 337−355. doi: 10.1007/s11083-009-9130-z

J. Järvinen, M. Kondo, J. Kortelainen: Logics from Galois connections, International Journal of Approximate Reasoning 49 (2008) 595−606. doi: 10.1016/j.ijar.2008.06.003

S. Pyysalo, F. Ginter, J. Heimonen, J. Björne, J. Boberg, J. Järvinen, T. Salakoski: BioInfer: a corpus for information extraction in the biomedical domain. BMC Bioinformatics 8 (2007) Article number 50. doi: 10.1186/1471-2105-8-50 

M. Murtojarvi, J. Järvinen, M. Johnsson, T. Leipälä, O. S. Nevalainen: Determining the Proper Number and Price of Software Licenses, IEEE Transactions on Software Engineering 33 (2007) 305−315. doi: 10.1109/TSE.2007.1003

J. Järvinen: Lattice Theory for Rough Sets, Transactions on Rough Sets VI (2007) 400−498. doi: 10.1007/978-3-540-71200-8_22

J. Järvinen, J. Kortelainen: A unifying study between modal-like operators, topologies, and fuzzy sets, Fuzzy Sets and Systems 158 (2007) 1217−1225. doi: 10.1016/j.fss.2007.01.011

J. Järvinen, M. Kondo, J. Kortelainen: Modal-like operators in Boolean lattices, Galois connections and fixed points, Fundamenta Informaticae 76 (2007) 129−145.

J. Järvinen: Pawlak's information systems in terms of Galois connections and functional dependencies, Fundamenta Informaticae 75 (2007) 315−330. Special volume dedicated to the memory of Zdzisław Pawlak.

J. Jarvinen: Set operations for L-fuzzy sets, Lecture Notes in Computer Science 4585 (2007) 221–229 doi: 10.1007/978-3-540-73451-2_24  

J. Järvinen: Incomplete Information: Structure, Inference, Complexity (book review), Studia Logica 84 (2006) 469–475. doi: 10.1007/s11225-006-9018-5 

J. Järvinen, E. Orłowska: Relational correspondences for lattices with operators, Lecture Notes in Computer Science 3929 (2006) 134−146. Selected revised papers of 8th International Seminar on Relational Methods in Computer Science. doi: 10.1007/11734673_11

S. Pyysalo, F. Ginter, T. Pahikkala, J. Boberg, J. Järvinen, T. Salakoski: Evaluation of two dependency parsers on biomedical corpus targeted at protein-protein interactions, International Journal of Medical Informatics 75 (2006) 430–442. doi: 10.1016/j.ijmedinf.2005.06.009

T. Pahikkala, F. Ginter, J. Boberg, J. Järvinen, T. Salakoski: Contextual weighting for Support Vector Machines in literature mining: an application to gene versus protein name disambiguation. BMC Bioinformatics 6 (2005) Article number 157. doi: 10.1186/1471-2105-6-157

J. Järvinen: Properties of rough approximations. Journal of Advanced Computational Intelligence and Intelligent Informatics  9 (2005) 502–505. doi: 10.20965/jaciii.2005.p0502

T. Pahikkala, S. Pyysalo, F. Ginter, J. Boberg, J. Järvinen, T. Salakoski: Kernels incorporating word positional information in natural language disambiguation tasks, Recent Advances in Artifical Intelligence - Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005, pages 442-447.

S. Pyysalo, F. Ginter, T. Pahikkala, J. Boberg, J. Järvinen, T. Salakoski, J. Koivula: 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 (NLPBA/BioNLP) (2004) 15–21.

F. Ginter, J. Boberg, J. Järvinen, T. Salakoski: New techniques for disambiguation in natural language and their application to biological text, Journal of Machine Learning Research 5 (2004) 605–621.

F. Ginter, S. Pyysalo, J. Boberg, J. Järvinen, T. Salakoski: Ontology-based feature transformations: A data-driven approach, Lecture Notes in Computer Science 3230 (2004) 279–290. doi: 10.1007/978-3-540-30228-5_25

F. Ginter, T. Pahikkala, S. Pyysalo, J. Boberg, J. Järvinen, T. Salakoski: Extracting protein-protein interaction sentences by applying rough set data analysis, Lecture Notes in Computer Science 3066 (2004) 780−785. doi: 10.1007/978-3-540-25929-9_99

J. Järvinen: The ordered set of rough sets, Lecture Notes in Computer Science 3066 (2004) 49−58. doi: 10.1007/978-3-540-25929-9_5

J. Järvinen: On the structure of rough approximations, Fundamenta Informaticae 53 (2002) 135−153.

J. Järvinen: On the structure of rough approximations (extended abstract), Lecture Notes in Computer Science 2475 (2002) 123–130. doi: 10.1007/3-540-45813-1_15

J. Järvinen: Dense families and key functions of database relation instances, Lecture Notes in Computer Science 2138 (2001) 184−192. doi: 10.1007/3-540-44669-9_19

J. Järvinen: Armstrong systems on ordered sets, Combinatorics, Computability and Logic (2001) 137−149. doi: 10.1007/978-1-4471-0717-0_12

J. Järvinen: Approximations and rough sets based on tolerances, Lecture Notes in Computer Science 2005 (2001) 182−189. doi: 10.1007/3-540-45554-X_21

J. Järvinen: Difference functions of dependence spaces, Acta Cybernetica 14 (2000) 619−630.

J. Järvinen: Tapan hiiriä, Novellit 1999, Gummerus (2000).

J. Järvinen: Knowledge Representation and Rough Sets, PhD Dissertation, University of Turku, Department of Mathematics, 1999.

J. Järvinen: Preimage relations and their matrices, Lecture Notes in Computer Science 1424 (1998) 139−146. doi: 10.1007/3-540-69115-4_20

J. Järvinen: A representation of dependence spaces and some basic algorithms, Fundamenta Informaticae 29 (1997) 369−382.