default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatti Kääriäinen
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[i2]Tapio Elomaa, Matti Kääriäinen:
An Analysis of Reduced Error Pruning. CoRR abs/1106.0668 (2011)
2000 – 2009
- 2009
- [c11]Matti Kääriäinen:
Sinuhe - statistical machine translation with a globally trained conditional exponential family translation model. SMART@EAMT 2009 - [c10]Matti Kääriäinen:
Sinuhe - Statistical Machine Translation using a Globally Trained Conditional Exponential Family Translation Model. EMNLP 2009: 1027-1036 - 2007
- [c9]Claire Monteleoni
, Matti Kääriäinen:
Practical Online Active Learning for Classification. CVPR 2007 - [i1]Matti Kääriäinen, Niels Landwehr, Sampsa Lappalainen, Taneli Mielikäinen:
Combining haplotypers. CoRR abs/0710.5116 (2007) - 2006
- [c8]Matti Kääriäinen:
Active Learning in the Non-realizable Case. ALT 2006: 63-77 - [c7]Matti Kääriäinen:
Semi-Supervised Model Selection Based on Cross-Validation. IJCNN 2006: 1894-1899 - 2005
- [c6]Matti Kääriäinen:
Generalization Error Bounds Using Unlabeled Data. COLT 2005: 127-142 - [c5]Matti Kääriäinen, John Langford:
A comparison of tight generalization error bounds. ICML 2005: 409-416 - 2004
- [j4]Tapio Elomaa, Matti Kääriäinen:
The Difficulty of Reduced Error Pruning of Leveled Branching Programs. Ann. Math. Artif. Intell. 41(1): 111-124 (2004) - [j3]Matti Kääriäinen, Tuomo Malinen, Tapio Elomaa:
Selective Rademacher Penalization and Reduced Error Pruning of Decision Trees. J. Mach. Learn. Res. 5: 1107-1126 (2004) - 2003
- [j2]Richard Nock, Tapio Elomaa, Matti Kääriäinen:
Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor. Inf. Process. Lett. 87(2): 73-78 (2003) - [c4]Matti Kääriäinen, Tapio Elomaa:
Rademacher Penalization over Decision Tree Prunings. ECML 2003: 193-204 - 2002
- [c3]Tapio Elomaa, Matti Kääriäinen:
Progressive Rademacher Sampling. AAAI/IAAI 2002: 140-145 - [c2]Tapio Elomaa, Matti Kääriäinen:
The Difficulty of Reduced Error Pruning of Leveled Branching Programs. AI&M 2002 - 2001
- [j1]Tapio Elomaa, Matti Kääriäinen:
An Analysis of Reduced Error Pruning. J. Artif. Intell. Res. 15: 163-187 (2001) - [c1]Tapio Elomaa, Matti Kääriäinen:
On the Practice of Branching Program Boosting. ECML 2001: 133-144
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 01:39 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:
