![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Emilia Oikarinen
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Anton Björklund
, Andreas Henelius, Emilia Oikarinen, Kimmo Kallonen, Kai Puolamäki
:
Explaining any black box model using real data. Frontiers Comput. Sci. 5 (2023) - [j13]Rafael Savvides
, Andreas Henelius
, Emilia Oikarinen
, Kai Puolamäki
:
Visual Data Exploration as a Statistical Testing Procedure: Within-View and Between-View Multiple Comparisons. IEEE Trans. Vis. Comput. Graph. 29(9): 3937-3948 (2023) - [c28]Erkki Kaila
, Antti Laaksonen
, Emilia Oikarinen
, Kjell Lemström
:
Commitment Threshold - On Student Retention in MOOCs. CompSysTech 2023: 139-145 - 2022
- [j12]Anton Björklund
, Andreas Henelius
, Emilia Oikarinen
, Kimmo Kallonen
, Kai Puolamäki
:
Robust regression via error tolerance. Data Min. Knowl. Discov. 36(2): 781-810 (2022) - 2021
- [j11]Emilia Oikarinen
, Henri Tiittanen, Andreas Henelius
, Kai Puolamäki
:
Detecting virtual concept drift of regressors without ground truth values. Data Min. Knowl. Discov. 35(3): 726-747 (2021) - [j10]Kai Puolamäki, Emilia Oikarinen, Andreas Henelius:
Guided Visual Exploration of Relations in Data Sets. J. Mach. Learn. Res. 22: 96:1-96:32 (2021) - 2020
- [j9]Kai Puolamäki
, Emilia Oikarinen
, Bo Kang
, Jefrey Lijffijt
, Tijl De Bie
:
Interactive visual data exploration with subjective feedback: an information-theoretic approach. Data Min. Knowl. Discov. 34(1): 21-49 (2020) - [c27]Jarkko Savela, Emilia Oikarinen
, Matti Järvisalo:
Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. LPAR 2020: 465-482
2010 – 2019
- 2019
- [j8]Virpi Kalakoski
, Andreas Henelius, Emilia Oikarinen
, Antti Ukkonen
, Kai Puolamäki
:
Cognitive ergonomics for data analysis. Experimental study of cognitive limitations in a data-based judgement task. Behav. Inf. Technol. 38(10): 1038-1047 (2019) - [c26]Anton Björklund
, Andreas Henelius, Emilia Oikarinen
, Kimmo Kallonen, Kai Puolamäki
:
Sparse Robust Regression for Explaining Classifiers. DS 2019: 351-366 - [c25]Virpi Kalakoski, Andreas Henelius, Emilia Oikarinen
, Antti Ukkonen
, Kai Puolamäki
:
Cognitive ergonomics for data analysis. ECCE 2019: 38-40 - [c24]Rafael Savvides, Andreas Henelius, Emilia Oikarinen
, Kai Puolamäki
:
Significance of Patterns in Data Visualisations. KDD 2019: 1509-1517 - [c23]Emilia Oikarinen
, Kai Puolamäki
, Samaneh Khoshrou
, Mykola Pechenizkiy
:
Supervised Human-Guided Data Exploration. PKDD/ECML Workshops (1) 2019: 85-101 - [i11]Kai Puolamäki, Emilia Oikarinen, Andreas Henelius:
Guided Visual Exploration of Relations in Data Sets. CoRR abs/1905.02515 (2019) - [i10]Henri Tiittanen, Emilia Oikarinen, Andreas Henelius, Kai Puolamäki:
Estimating regression errors without ground truth values. CoRR abs/1910.04069 (2019) - 2018
- [c22]Kai Puolamäki
, Emilia Oikarinen
, Bo Kang, Jefrey Lijffijt
, Tijl De Bie:
Interactive Visual Data Exploration with Subjective Feedback: An Information-Theoretic Approach. ICDE 2018: 1208-1211 - [c21]Jefrey Lijffijt
, Bo Kang, Wouter Duivesteijn, Kai Puolamäki
, Emilia Oikarinen
, Tijl De Bie:
Subjectively Interesting Subgroup Discovery on Real-Valued Targets. ICDE 2018: 1352-1355 - [c20]Andreas Henelius, Emilia Oikarinen
, Kai Puolamäki
:
Tiler: Software for Human-Guided Data Exploration. ECML/PKDD (3) 2018: 672-676 - [i9]Andreas Henelius, Emilia Oikarinen, Kai Puolamäki:
Human-Guided Data Exploration. CoRR abs/1804.03194 (2018) - [i8]Kai Puolamäki, Emilia Oikarinen, Buse Gul Atli, Andreas Henelius:
Human-guided data exploration using randomisation. CoRR abs/1805.07725 (2018) - 2017
- [c19]Jeremias Berg
, Emilia Oikarinen, Matti Järvisalo, Kai Puolamäki
:
Minimum-Width Confidence Bands via Constraint Optimization. CP 2017: 443-459 - [c18]Jussi Korpela, Emilia Oikarinen
, Kai Puolamäki
, Antti Ukkonen
:
Multivariate Confidence Intervals. SDM 2017: 696-704 - [i7]Jefrey Lijffijt, Bo Kang, Wouter Duivesteijn, Kai Puolamäki, Emilia Oikarinen, Tijl De Bie:
Subjectively Interesting Subgroup Discovery on Real-valued Targets. CoRR abs/1710.04521 (2017) - [i6]Kai Puolamäki, Emilia Oikarinen, Bo Kang, Jefrey Lijffijt, Tijl De Bie:
Interactive Visual Data Exploration with Subjective Feedback: An Information-Theoretic Approach. CoRR abs/1710.08167 (2017) - 2015
- [j7]Laura Koponen, Emilia Oikarinen
, Tomi Janhunen, Laura Säilä:
Optimizing phylogenetic supertrees using answer set programming. Theory Pract. Log. Program. 15(4-5): 604-619 (2015) - [i5]Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä:
Optimizing Phylogenetic Supertrees Using Answer Set Programming. CoRR abs/1507.05272 (2015) - 2014
- [c17]Wolfgang Dvorák, Thomas Linsbichler, Emilia Oikarinen
, Stefan Woltran:
Resolution-Based Grounded Semantics Revisited. COMMA 2014: 269-280 - [c16]Emilia Oikarinen
, Matti Järvisalo
:
Answer Set Solver Backdoors. JELIA 2014: 674-683 - [i4]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. CoRR abs/1401.3484 (2014) - 2011
- [j6]Emilia Oikarinen
, Stefan Woltran:
Characterizing strong equivalence for argumentation frameworks. Artif. Intell. 175(14-15): 1985-2009 (2011) - 2010
- [c15]Emilia Oikarinen, Stefan Woltran:
Characterizing Strong Equivalence for Argumentation Frameworks. KR 2010
2000 – 2009
- 2009
- [j5]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. 35: 813-857 (2009) - [j4]Emilia Oikarinen
, Tomi Janhunen:
A Translation-based Approach to the Verification of Modular Equivalence. J. Log. Comput. 19(4): 591-613 (2009) - [c14]Matti Järvisalo
, Emilia Oikarinen
, Tomi Janhunen, Ilkka Niemelä:
A Module-Based Framework for Multi-language Constraint Modeling. LPNMR 2009: 155-168 - [c13]Emilia Oikarinen
, Matti Järvisalo
:
Max-ASP: Maximum Satisfiability of Answer Set Programs. LPNMR 2009: 236-249 - 2008
- [b1]Emilia Oikarinen:
Modularity in answer set programs. Helsinki University of Technology, Finland, 2008 - [j3]Matti Järvisalo
, Emilia Oikarinen
:
Extended ASP Tableaux and rule redundancy in normal logic programs. Theory Pract. Log. Program. 8(5-6): 691-716 (2008) - [j2]Emilia Oikarinen
, Tomi Janhunen:
Achieving compositionality of the stable model semantics for smodels programs. Theory Pract. Log. Program. 8(5-6): 717-761 (2008) - [c12]Emilia Oikarinen
, Tomi Janhunen:
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. AIMSA 2008: 167-180 - [i3]Matti Järvisalo, Emilia Oikarinen:
Extended ASP tableaux and rule redundancy in normal logic programs. CoRR abs/0809.3204 (2008) - [i2]Emilia Oikarinen, Tomi Janhunen:
Achieving compositionality of the stable model semantics for Smodels programs. CoRR abs/0809.4582 (2008) - 2007
- [j1]Tomi Janhunen, Emilia Oikarinen
:
Automated Verification of Weak Equivalence within the SMODELS System. Theory Pract. Log. Program. 7(6): 697-744 (2007) - [c11]Matti Järvisalo
, Emilia Oikarinen:
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs. ICLP 2007: 134-148 - [c10]Emilia Oikarinen, Tomi Janhunen:
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. ICLP 2007: 440-441 - [c9]Emilia Oikarinen:
Modular Answer Set Programming. ICLP 2007: 462-463 - [c8]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187 - [c7]Emilia Oikarinen:
Modularity in smodelsPrograms. LPNMR 2007: 321-326 - 2006
- [c6]Emilia Oikarinen, Tomi Janhunen:
Modular Equivalence for Normal Logic Programs. ECAI 2006: 412-416 - [i1]Tomi Janhunen, Emilia Oikarinen:
Automated verification of weak equivalence within the SMODELS system. CoRR abs/cs/0608099 (2006) - 2005
- [c5]Emilia Oikarinen
, Tomi Janhunen:
circ2dlp - Translating Circumscription into Disjunctive Logic Programming. LPNMR 2005: 405-409 - 2004
- [c4]Tomi Janhunen, Emilia Oikarinen:
Capturing Parallel Circumscription with Disjunctive Logic Programs. JELIA 2004: 134-146 - [c3]Emilia Oikarinen, Tomi Janhunen:
Verifying the Equivalence of Logic Programs in the Disjunctive Case. LPNMR 2004: 180-193 - [c2]Tomi Janhunen, Emilia Oikarinen:
LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. LPNMR 2004: 336-340 - 2002
- [c1]Tomi Janhunen, Emilia Oikarinen:
Testing the Equivalence of Logic Programs under Stable Model Semantics. JELIA 2002: 493-504
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint