Wook-Shin Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wook-Shin Han has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Kyu-Young Whang
KAIST
9 shared publications - Hwanjo Yu
Pohang University of Science and Technology, Pohang, Republic of Korea
3 shared publications - Jae-Gil Lee
Korea Advanced Institute of Science and Technology (KAIST)
3 shared publications - Ki-Hoon Lee
School of Computer and Information Engineering, Kwangwoon University, Nowon-gu, Seoul, Republic of Korea
3 shared publications - Min-Jae Lee
Korea Advanced Institute of Science and Technology (KAIST)
3 shared publications - Min-Soo Kim
Korea Advanced Institute of Science and Technology (KAIST)
3 shared publications
Latest Publications
- Open Access
- 24 November 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (S12) , S4
Combining active learning and semi-supervised learning techniques to extract protein interaction sentences
Protein-protein interaction (PPI) extraction has been a focal point of many biomedical research and database curation tools. Both Active Learning and Semi-supervised SVMs have recently been applied to extract PPI automatically. In this paper, we explore combining the AL with the SSL to improve the performance of the PPI task.
- 24 November 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (S12) , S4
Open AccessCombining active learning and semi-supervised learning techniques to extract protein interaction sentences
Protein-protein interaction (PPI) extraction has been a focal point of many biomedical research and database curation tools. Both Active Learning and Semi-supervised SVMs have recently been applied to extract PPI automatically. In this paper, we explore combining the AL with the SSL to improve the performance of the PPI task.
- 17 August 2011
- Published by Springer Nature in World Wide Web
- Vol. 15 (3) , 325
Special issue: best papers of APWeb 2010
- 17 August 2011
- Published by Springer Nature in World Wide Web
- Vol. 15 (3) , 325
Special issue: best papers of APWeb 2010
- Open Access
- 29 March 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (S2) , S6
Processing SPARQL queries with regular expressions in RDF databases
As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C recommendation query for RDF databases - has become an important query language for querying the bioinformatics knowledge bases. Moreover, due to the diversity of users’ requests for extracting information from the RDF data as well as the lack of users’ knowledge about the exact value of each fact in the RDF databases, it is desirable to use the SPARQL query with regular expression patterns for querying the RDF data. To the best of our knowledge, there is currently no work that efficiently supports regular expression processing in SPARQL over RDF databases. Most of the existing techniques for processing regular expressions are designed for querying a text corpus, or only for supporting the matching over the paths in an RDF graph.
- 29 March 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (S2) , S6
Open AccessProcessing SPARQL queries with regular expressions in RDF databases
As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C recommendation query for RDF databases - has become an important query language for querying the bioinformatics knowledge bases. Moreover, due to the diversity of users’ requests for extracting information from the RDF data as well as the lack of users’ knowledge about the exact value of each fact in the RDF databases, it is desirable to use the SPARQL query with regular expression patterns for querying the RDF data. To the best of our knowledge, there is currently no work that efficiently supports regular expression processing in SPARQL over RDF databases. Most of the existing techniques for processing regular expressions are designed for querying a text corpus, or only for supporting the matching over the paths in an RDF graph.
- 1 November 2010
- Published by Elsevier in Information Sciences
- Vol. 180 (21) , 4118-4135
Type-level access pattern view: Enhancing prefetching performance using the iterative and recursive patterns
- 1 November 2010
- Published by Elsevier in Information Sciences
- Vol. 180 (21) , 4118-4135
Type-level access pattern view: Enhancing prefetching performance using the iterative and recursive patterns
- Open Access
- 16 April 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (S2) , S6
Enabling multi-level relevance feedback on PubMed by integrating rank learning into DBMS
Finding relevant articles from PubMed is challenging because it is hard to express the user's specific intention in the given query interface, and a keyword query typically retrieves a large number of results. Researchers have applied machine learning techniques to find relevant articles by ranking the articles according to the learned relevance function. However, the process of learning and ranking is usually done offline without integrated with the keyword queries, and the users have to provide a large amount of training documents to get a reasonable learning accuracy. This paper proposes a novel multi-level relevance feedback system for PubMed, called RefMed, which supports both ad-hoc keyword queries and a multi-level relevance feedback in real time on PubMed.
- 16 April 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (S2) , S6
Open AccessEnabling multi-level relevance feedback on PubMed by integrating rank learning into DBMS
Finding relevant articles from PubMed is challenging because it is hard to express the user's specific intention in the given query interface, and a keyword query typically retrieves a large number of results. Researchers have applied machine learning techniques to find relevant articles by ranking the articles according to the learned relevance function. However, the process of learning and ranking is usually done offline without integrated with the keyword queries, and the users have to provide a large amount of training documents to get a reasonable learning accuracy. This paper proposes a novel multi-level relevance feedback system for PubMed, called RefMed, which supports both ad-hoc keyword queries and a multi-level relevance feedback in real time on PubMed.
- 13 April 2010
- Published by Springer Nature in World Wide Web
- Vol. 13 (3) , 343-371
XMin: Minimizing Tree Pattern Queries with Minimality Guarantee
- 13 April 2010
- Published by Springer Nature in World Wide Web
- Vol. 13 (3) , 343-371
XMin: Minimizing Tree Pattern Queries with Minimality Guarantee
- 26 February 2010
- Published by Springer Nature in The VLDB Journal
- Vol. 19 (4) , 503-529
Structural consistency: enabling XML keyword search to eliminate spurious results consistently
- 26 February 2010
- Published by Springer Nature in The VLDB Journal
- Vol. 19 (4) , 503-529
Structural consistency: enabling XML keyword search to eliminate spurious results consistently
- Open Access
Structural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently
XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to remove spurious results not intended by the user. Efforts to eliminate spurious results have enjoyed some success by using the concepts of LCA or its variants, SLCA and MLCA. However, existing methods still could find many spurious results. The fundamental cause for the occurrence of spurious results is that the existing methods try to eliminate spurious results locally without global examination of all the query results and, accordingly, some spurious results are not consistently eliminated. In this paper, we propose a novel keyword search method that removes spurious results consistently by exploiting the new concept of structural consistency.
Open AccessStructural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently
XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to remove spurious results not intended by the user. Efforts to eliminate spurious results have enjoyed some success by using the concepts of LCA or its variants, SLCA and MLCA. However, existing methods still could find many spurious results. The fundamental cause for the occurrence of spurious results is that the existing methods try to eliminate spurious results locally without global examination of all the query results and, accordingly, some spurious results are not consistently eliminated. In this paper, we propose a novel keyword search method that removes spurious results consistently by exploiting the new concept of structural consistency.
- 7 May 2009
- Published by Springer Nature in GeoInformatica
- Vol. 14 (4) , 425-446
Tightly-coupled spatial database features in the Odysseus/OpenGIS DBMS for high-performance
- 7 May 2009
- Published by Springer Nature in GeoInformatica
- Vol. 14 (4) , 425-446
Tightly-coupled spatial database features in the Odysseus/OpenGIS DBMS for high-performance
- 19 December 2006
- Published by Springer Nature in The VLDB Journal
- Vol. 16 (3) , 371-387
The dynamic predicate: integrating access control with query processing in XML databases
- 19 December 2006
- Published by Springer Nature in The VLDB Journal
- Vol. 16 (3) , 371-387
The dynamic predicate: integrating access control with query processing in XML databases