default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSang-Hyeun Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2012
[b1]Sang-Hyeun Park:
Efficient decomposition-based multiclass and multilabel classification. Darmstadt University of Technology, Germany, 2012, pp. 1-166
Journal Articles
- 2014
- [j4]Sang-Hyeun Park, Johannes Fürnkranz
:
Efficient implementation of class-based decomposition schemes for Naïve Bayes. Mach. Learn. 96(3): 295-309 (2014) - 2012
- [j3]Sang-Hyeun Park, Johannes Fürnkranz:
Efficient prediction algorithms for binary decomposition techniques. Data Min. Knowl. Discov. 24(1): 40-77 (2012) - [j2]Johannes Fürnkranz, Eyke Hüllermeier, Weiwei Cheng, Sang-Hyeun Park:
Preference-based reinforcement learning: a formal framework and a policy iteration algorithm. Mach. Learn. 89(1-2): 123-156 (2012) - 2010
- [j1]Eneldo Loza Mencía, Sang-Hyeun Park, Johannes Fürnkranz:
Efficient voting prediction for pairwise multilabel classification. Neurocomputing 73(7-9): 1164-1176 (2010)
Conference and Workshop Papers
- 2019
- [c10]Valentin Wagner, Stephan Dlugosz, Sang-Hyeun Park, Philipp Bartke:
Insourcing the Passenger Demand Forecasting System for Revenue Management at DB Fernverkehr: Lessons Learned from the First Year. OR 2019: 625-631 - 2012
- [c9]Johannes Fürnkranz, Sang-Hyeun Park:
Error-Correcting Output Codes as a Transformation from Multi-Class to Multi-Label Prediction. Discovery Science 2012: 254-267 - 2011
- [c8]Weiwei Cheng, Johannes Fürnkranz, Eyke Hüllermeier, Sang-Hyeun Park:
Preference-Based Policy Iteration: Leveraging Preference Learning for Reinforcement Learning. ECML/PKDD (1) 2011: 312-327 - 2010
- [c7]Sang-Hyeun Park, Lorenz Weizsäcker, Johannes Fürnkranz:
Exploiting Code Redundancies in ECOC. Discovery Science 2010: 266-280 - 2009
- [c6]Eneldo Loza Mencía, Sang-Hyeun Park, Johannes Fürnkranz:
Efficient voting prediction for pairwise multilabel classification. ESANN 2009 - [c5]Immanuel Schweizer, Kamill Panitzek, Sang-Hyeun Park, Johannes Fürnkranz:
An Exploitative Monte-Carlo Poker Agent. KI 2009: 65-72 - [c4]Immanuel Schweizer, Kamill Panitzek, Sang-Hyeun Park, Johannes Fürnkranz:
An Exploitative Monte-Carlo Poker Agent. LWA 2009: KDML:100-104 - [c3]Eneldo Loza Mencía, Sang-Hyeun Park, Johannes Fürnkranz:
Efficient Voting Prediction for Pairwise Multilabel Classification. LWA 2009: KDML:72-75 - [c2]Sang-Hyeun Park, Johannes Fürnkranz:
Efficient Decoding of Ternary Error-Correcting Output Codes for Multiclass Classification. ECML/PKDD (2) 2009: 189-204 - 2007
- [c1]Sang-Hyeun Park, Johannes Fürnkranz:
Efficient Pairwise Classification. ECML 2007: 658-665
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-04-24 23:09 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:
