default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJouni Järvinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Jouni Järvinen
, Sándor Radeleczki, Umberto Rivieccio:
Nelson algebras, residuated lattices and rough sets: A survey. J. Appl. Non Class. Logics 34(2-3): 368-428 (2024)- [j32]Jouni Järvinen, Michiro Kondo:
Relational correspondences for L-fuzzy rough approximations defined on De Morgan Heyting algebras. Soft Comput. 28(2): 903-916 (2024) - [i8]Jouni Järvinen, Sándor Radeleczki, Umberto Rivieccio:
Nelson algebras, residuated lattices and rough sets: A survey. CoRR abs/2402.02606 (2024) - 2023
- [j31]Jouni Järvinen, Sándor Radeleczki:
Pseudo-Kleene algebras determined by rough sets. Int. J. Approx. Reason. 161: 108991 (2023) - [i7]Jouni Järvinen, Sándor Radeleczki:
Pseudo-Kleene algebras determined by rough sets. CoRR abs/2304.05641 (2023) - [i6]Jouni Järvinen, Michiro Kondo:
Relational correspondences for L-fuzzy rough approximations defined on De~Morgan Heyting algebras. CoRR abs/2307.16055 (2023) - 2021
- [j30]Jouni Järvinen, Sándor Radeleczki:
Defining rough sets as core-support pairs of three-valued functions. Int. J. Approx. Reason. 135: 71-90 (2021) - 2020
- [j29]Jouni Järvinen, Sándor Radeleczki:
The Structure of Multigranular Rough Sets. Fundam. Informaticae 176(1): 17-41 (2020) - [i5]Jouni Järvinen, Sándor Radeleczki:
The structure of multigranular rough sets. CoRR abs/2002.05238 (2020) - [i4]Jouni Järvinen, Sándor Radeleczki:
Defining rough sets as core-support pairs of three-valued functions. CoRR abs/2011.03461 (2020)
2010 – 2019
- 2019
- [j28]Jouni Järvinen, László Kovács, Sándor Radeleczki:
Defining rough sets using tolerances compatible with an equivalence. Inf. Sci. 496: 264-283 (2019) - [c13]Jouni Järvinen, László Kovács, Sándor Radeleczki:
Rough Sets Defined by Multiple Relations. IJCRS 2019: 40-51 - 2018
- [i3]Jouni Järvinen, László Kovács, Sándor Radeleczki:
Defining rough sets using tolerances compatible with an equivalence. CoRR abs/1811.09609 (2018) - 2016
- [i2]Jouni Järvinen, Sándor Radeleczki:
Representing regular Kleene algebras by tolerance-based rough sets. CoRR abs/1610.09847 (2016) - 2015
- [j27]Jouni Järvinen, Sándor Radeleczki:
Tolerances Induced by Irredundant Coverings. Fundam. Informaticae 137(3): 341-353 (2015) - 2014
- [j26]Jouni Järvinen, Sándor Radeleczki:
Monteiro Spaces and Rough Sets Determined by Quasiorder Relations: Models for Nelson algebras. Fundam. Informaticae 131(2): 205-215 (2014) - [j25]Wojciech Dzik, Jouni Järvinen, Michiro Kondo:
Characterizing intermediate tense logics in terms of Galois connections. Log. J. IGPL 22(6): 992-1018 (2014) - [j24]Wojciech Dzik, Jouni Järvinen, Michiro Kondo:
Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets. Int. J. Approx. Reason. 55(1): 427-435 (2014) - [j23]Jouni Järvinen, Sándor Radeleczki:
Rough sets determined by tolerances. Int. J. Approx. Reason. 55(6): 1419-1438 (2014) - [i1]Jouni Järvinen, Sándor Radeleczki:
Tolerances induced by irredundant coverings. CoRR abs/1404.5184 (2014) - 2013
- [j22]Wojciech Dzik, Jouni Järvinen, Michiro Kondo:
Intuitionistic modal logic with a galois connection has the finite model property1. Log. J. IGPL 21(2): 199-204 (2013) - [j21]Jouni Järvinen, Piero Pagliani, Sándor Radeleczki:
Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders. Stud Logica 101(5): 1073-1092 (2013) - 2010
- [j20]Wojciech Dzik, Jouni Järvinen, Michiro Kondo:
Intuitionistic propositional logic with Galois connections. Log. J. IGPL 18(6): 837-858 (2010)
2000 – 2009
- 2009
- [j19]Tapio Pahikkala, Sampo Pyysalo, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
Matrix representations, linear transformations, and kernels for disambiguation in natural language. Mach. Learn. 74(2): 133-158 (2009) - [j18]Tapio Pahikkala, Evgeni Tsivtsivadze, Antti Airola, Jouni Järvinen, Jorma Boberg:
An efficient algorithm for learning to rank from preference graphs. Mach. Learn. 75(1): 129-165 (2009) - [j17]Jouni Järvinen, Sándor Radeleczki, Laura Veres:
Rough Sets Determined by Quasiorders. Order 26(4): 337-355 (2009) - 2008
- [j16]Jouni Järvinen, Michiro Kondo, Jari Kortelainen:
Logics from Galois connections. Int. J. Approx. Reason. 49(3): 595-606 (2008) - 2007
- [j15]Sampo Pyysalo, Filip Ginter, Juho Heimonen, Jari Björne, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
BioInfer: a corpus for information extraction in the biomedical domain. BMC Bioinform. 8 (2007) - [j14]Jouni Järvinen, Jari Kortelainen:
A unifying study between modal-like operators, topologies and fuzzy sets. Fuzzy Sets Syst. 158(11): 1217-1225 (2007) - [j13]Jouni Järvinen:
Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies. Fundam. Informaticae 75(1-4): 315-330 (2007) - [j12]Jouni Järvinen, Michiro Kondo, Jari Kortelainen:
Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points. Fundam. Informaticae 76(1-2): 129-145 (2007) - [j11]Jouni Järvinen:
Lattice Theory for Rough Sets. Trans. Rough Sets 6: 400-498 (2007) - [j10]Mika Murtojärvi, Jouni Järvinen, Mika Johnsson, Timo Leipälä, Olli Nevalainen:
Determining the Proper Number and Price of Software Licenses. IEEE Trans. Software Eng. 33(5): 305-315 (2007) - [c12]Jouni Järvinen:
Set Operations for L -Fuzzy Sets. RSEISP 2007: 221-229 - 2006
- [j9]Sampo Pyysalo, Filip Ginter, Tapio Pahikkala, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
Evaluation of two dependency parsers on biomedical corpus targeted at protein-protein interactions. Int. J. Medical Informatics 75(6): 430-442 (2006) - [j8]Jouni Järvinen:
Incomplete Information: Structure, Inference, Complexity. Stud Logica 84(3): 469-475 (2006) - 2005
- [j7]Tapio Pahikkala, Filip Ginter, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
Contextual weighting for Support Vector Machines in literature mining: an application to gene versus protein name disambiguation. BMC Bioinform. 6: 157 (2005) - [j6]Jouni Järvinen:
Properties of Rough Approximations. J. Adv. Comput. Intell. Intell. Informatics 9(5): 502-505 (2005) - [c11]Jouni Järvinen, Ewa Orlowska:
Relational Correspondences for Lattices with Operators. RelMiCS 2005: 134-146 - [c10]Tapio Pahikkala, Sampo Pyysalo, Filip Ginter, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
Kernels Incorporating Word Positional Information in Natural Language Disambiguation Tasks. FLAIRS 2005: 442-448 - 2004
- [j5]Filip Ginter, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
New Techniques for Disambiguation in Natural Language and Their Application to Biological Text. J. Mach. Learn. Res. 5: 605-621 (2004) - [c9]Sampo Pyysalo, Filip Ginter, Tapio Pahikkala, Jorma Boberg, Jouni Järvinen, Tapio Salakoski, Jeppe Koivula:
Analysis of Link Grammar on Biomedical Dependency Corpus Targeted at Protein-Protein Interactions. NLPBA/BioNLP 2004 - [c8]Jouni Järvinen:
The Ordered Set of Rough Sets. Rough Sets and Current Trends in Computing 2004: 49-58 - [c7]Filip Ginter, Tapio Pahikkala, Sampo Pyysalo, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
Extracting Protein-Protein Interaction Sentences by Applying Rough Set Data Analysis. Rough Sets and Current Trends in Computing 2004: 780-785 - [c6]Filip Ginter, Sampo Pyysalo, Jorma Boberg, Jouni Järvinen, Tapio Salakoski:
Ontology-Based Feature Transformations: A Data-Driven Approach. EsTAL 2004: 280-291 - 2002
- [j4]Jouni Järvinen:
On the Structure of Rough Approximations. Fundam. Informaticae 53(2): 135-153 (2002) - [c5]Jouni Järvinen:
On the Structure of Rough Approximations. Rough Sets and Current Trends in Computing 2002: 123-130 - 2001
- [c4]Jouni Järvinen:
Armstrong Systems on Ordered Sets. DMTCS 2001: 137-149 - [c3]Jouni Järvinen:
Dense Families and Key Functions of Database Relation Instances. FCT 2001: 184-192 - 2000
- [j3]Jouni Järvinen:
Difference Functions of Dependence Spaces. Acta Cybern. 14(4): 619-630 (2000) - [j2]Jouni Järvinen, Tomi Pasanen:
Two exercises. SIGACT News 31(1): 75-76 (2000) - [c2]Jouni Järvinen:
Approximations and Rough Sets Based on Tolerances. Rough Sets and Current Trends in Computing 2000: 182-189
1990 – 1999
- 1998
- [c1]Jouni Järvinen:
Preimage Relations and Their Matrices. Rough Sets and Current Trends in Computing 1998: 139-146 - 1997
- [j1]Jouni Järvinen:
A Representation of Dependence Spaces and Some Basic Algorithms. Fundam. Informaticae 29(4): 369-382 (1997)
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 2024-09-13 00:44 CEST 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:
