Sangwon Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Sangwon Lee has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dong-Hyuk Im
School of Information Convergence, Kwangwoon University, Seoul, Republic of Korea
1 shared publication - Gil-Jin Jang
School of Electronic and Electrical Engineering, Kyungpook National University, Daegu 41566, Republic of Korea
1 shared publication - Hyeonseong Jeon
Sungkyunkwan University
1 shared publication - Hyoung-Joo Kim
School of Computer Science and Engineering, Seoul National University, Seoul 151-744, Republic of Korea
1 shared publication Naeun Lee
Dept. of Interaction Science, Sungkyunkwan University, Korea
1 shared publication- Siho Han
Sungkyunkwan University
1 shared publication
Latest Publications
- 26 February 2021
- Published by Springer Nature
- p. 532-548
Compensating for the Lack of Extra Training Data by Learning Extra Representation
- 26 February 2021
- Published by Springer Nature
- p. 532-548
Compensating for the Lack of Extra Training Data by Learning Extra Representation
- 6 January 2019
- Published by Springer Nature
- p. 223-227
Stochastic Drop of Kernel Windows for Improved Generalization in Convolution Neural Networks
- 6 January 2019
- Published by Springer Nature
- p. 223-227
Stochastic Drop of Kernel Windows for Improved Generalization in Convolution Neural Networks
- Open Access
- 5 January 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-4
The Effect of Back-Channeling Cues on Motivation to Continue Human-Machine Textual Interaction
- 5 January 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessThe Effect of Back-Channeling Cues on Motivation to Continue Human-Machine Textual Interaction
- 28 November 2012
- Published by SAGE Publications in Journal of Information Science
- Vol. 39 (2) , 238-255
Backward inference and pruning for RDF change detection using RDBMS
Recent studies on change detection for RDF data have focused on minimizing the delta size and, as a way to exploit the semantics of RDF models in reducing the delta size, the forward-chaining inferences have been widely employed. However, since the forward-chaining inferences should pre-compute the entire closure of the RDF model, the existing approaches are not scalable to large RDF data sets. In this paper, we propose a scalable change detection scheme for RDF data, which is based on backward-chaining inference and pruning. Our scheme, instead of pre-computing the full closure, computes only the necessary closure on the fly, thus achieving fast and scalable change detection. In addition, for any two RDF data input files to be compared, the delta obtained from our scheme is always equivalent to the one from the existing forward-chaining inferences. In addition, in order to handle RDF data sets too large to fit in the available RAM, we present an SQL-based implementation of our scheme. Our experimental results show that our scheme, in comparison to the existing schemes, can reduce the number of inference triples for RDF change detection by 10–60%.
- 28 November 2012
- Published by SAGE Publications in Journal of Information Science
- Vol. 39 (2) , 238-255
Backward inference and pruning for RDF change detection using RDBMS
Recent studies on change detection for RDF data have focused on minimizing the delta size and, as a way to exploit the semantics of RDF models in reducing the delta size, the forward-chaining inferences have been widely employed. However, since the forward-chaining inferences should pre-compute the entire closure of the RDF model, the existing approaches are not scalable to large RDF data sets. In this paper, we propose a scalable change detection scheme for RDF data, which is based on backward-chaining inference and pruning. Our scheme, instead of pre-computing the full closure, computes only the necessary closure on the fly, thus achieving fast and scalable change detection. In addition, for any two RDF data input files to be compared, the delta obtained from our scheme is always equivalent to the one from the existing forward-chaining inferences. In addition, in order to handle RDF data sets too large to fit in the available RAM, we present an SQL-based implementation of our scheme. Our experimental results show that our scheme, in comparison to the existing schemes, can reduce the number of inference triples for RDF change detection by 10–60%.