Hong-Jun Jang
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
Hong-Jun Jang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Soon-Young Jung
Department of Biochemistry, College of Medicine, The Catholic University of Korea, Seoul, 06591, South Korea; Institute for Aging and Metabolic Diseases, College of Medicine, The Catholic University of Korea, Seoul, 06591, South Korea
9 shared publications - Byoungwook Kim
Dongshin University
5 shared publications - Jaehwa Chung
Korea National Open University
4 shared publications - Jongwan Kim
Software Convergence Education Center Sahmyook University 1 삼육대학교 인공지능융합학부 대한민국 2 삼육대학교 서울특별시 노원구 화랑로 815 01795 (01795 815 Seoul SW융합교육원 서울특별시 노원구 화랑로 Republic of Korea
3 shared publications - Kyeong-Seok Hyun
Korea University
2 shared publications - Kyoung-Ho Jung
Korea University
2 shared publications
Latest Publications
- 25 August 2019
- Published by Wiley in International Journal of Communication Systems
- Vol. 34 (2)
k‐nearest reliable neighbor search in crowdsourced LBSs
Summary: To improve the quality of spatial information in a location‐based services (LBS), crowdsourced LBS (cLBS) applications that receive additional information such as the visit time of static spatial objects from users have appeared. In this paper, we propose a new type of nearest neighbor (NN) query called the k‐nearest reliable neighbor (kNRN) query, which searches for objects that are likely to exist. Suppose that in cLBSs, the user wants to find a restaurant that is likely to exist and is close to the user. In such a case, a kNRN query is highly recommended. In this paper, we formally define a data model in cLBSs and define reliable objects and a kNRN problem. As a brute‐force approach to this problem in a massive dataset that has large computational and I/O costs, we propose a 3DR‐tree‐based baseline algorithm, 2DR‐tree‐based incremental algorithm, and an a3DR‐tree‐based branch‐and‐bound algorithm for kNRN queries. A performance study is conducted on both synthetic and real datasets. Our experimental results show the efficiency of our proposed methods.
- 25 August 2019
- Published by Wiley in International Journal of Communication Systems
- Vol. 34 (2)
k‐nearest reliable neighbor search in crowdsourced LBSs
Summary: To improve the quality of spatial information in a location‐based services (LBS), crowdsourced LBS (cLBS) applications that receive additional information such as the visit time of static spatial objects from users have appeared. In this paper, we propose a new type of nearest neighbor (NN) query called the k‐nearest reliable neighbor (kNRN) query, which searches for objects that are likely to exist. Suppose that in cLBSs, the user wants to find a restaurant that is likely to exist and is close to the user. In such a case, a kNRN query is highly recommended. In this paper, we formally define a data model in cLBSs and define reliable objects and a kNRN problem. As a brute‐force approach to this problem in a massive dataset that has large computational and I/O costs, we propose a 3DR‐tree‐based baseline algorithm, 2DR‐tree‐based incremental algorithm, and an a3DR‐tree‐based branch‐and‐bound algorithm for kNRN queries. A performance study is conducted on both synthetic and real datasets. Our experimental results show the efficiency of our proposed methods.
- 10 April 2019
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 62 (3) , 867-897
Nearest base-neighbor search on spatial datasets
- 10 April 2019
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 62 (3) , 867-897
Nearest base-neighbor search on spatial datasets
- Open Access
- 25 March 2019
- Published by MDPI AG in Sustainability
- Vol. 11 (6) , 1801
Correction: An Efficient Grid-Based K-Prototypes Algorithm for Sustainable Decision Making Using Spatial Objects. Sustainability 2018, 10, 2614
The authors would like to make the following corrections to this paper
- 25 March 2019
- Published by MDPI AG in Sustainability
- Vol. 11 (6) , 1801
Open AccessCorrection: An Efficient Grid-Based K-Prototypes Algorithm for Sustainable Decision Making Using Spatial Objects. Sustainability 2018, 10, 2614
The authors would like to make the following corrections to this paper
- Open Access
- 25 July 2018
- Published by MDPI AG in Sustainability
- Vol. 10 (8) , 2614
An Efficient Grid-Based K-Prototypes Algorithm for Sustainable Decision-Making on Spatial Objects
Data mining plays a critical role in sustainable decision-making. Although the k-prototypes algorithm is one of the best-known algorithms for clustering both numeric and categorical data, clustering a large number of spatial objects with mixed numeric and categorical attributes is still inefficient due to complexity. In this paper, we propose an efficient grid-based k-prototypes algorithm, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can reduce unnecessary distance calculation. The second proposed algorithm as an extension of the first proposed algorithm, utilizes spatial dependence; spatial data tends to be similar to objects that are close. Each cell has a bitmap index which stores the categorical values of all objects within the same cell for each attribute. This bitmap index can improve performance if the categorical data is skewed. Experimental results show that the proposed algorithms can achieve better performance than the existing pruning techniques of the k-prototypes algorithm.
- 25 July 2018
- Published by MDPI AG in Sustainability
- Vol. 10 (8) , 2614
Open AccessAn Efficient Grid-Based K-Prototypes Algorithm for Sustainable Decision-Making on Spatial Objects
Data mining plays a critical role in sustainable decision-making. Although the k-prototypes algorithm is one of the best-known algorithms for clustering both numeric and categorical data, clustering a large number of spatial objects with mixed numeric and categorical attributes is still inefficient due to complexity. In this paper, we propose an efficient grid-based k-prototypes algorithm, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can reduce unnecessary distance calculation. The second proposed algorithm as an extension of the first proposed algorithm, utilizes spatial dependence; spatial data tends to be similar to objects that are close. Each cell has a bitmap index which stores the categorical values of all objects within the same cell for each attribute. This bitmap index can improve performance if the categorical data is skewed. Experimental results show that the proposed algorithms can achieve better performance than the existing pruning techniques of the k-prototypes algorithm.
- Open Access
- 27 June 2018
- Published by MDPI AG in Preprints.org
An Efficient Grid-based K-prototypes Algorithm for Sustainable Decision Making Using Spatial Objects
Data mining plays a critical role in the sustainable decision making. The k-prototypes algorithm is one of the best-known algorithm for clustering both numeric and categorical data. Despite this, however, clustering a large number of spatial object with mixed numeric and categorical attributes is still inefficient due to its high time complexity. In this paper, we propose an efficient grid-based k-prototypes algorithms, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can remove unnecessary distance calculation. The second proposed algorithm as extensions of the first proposed algorithm utilizes spatial dependence that spatial data tend to be more similar as objects are closer. Each cell has a bitmap index which stores categorical values of all objects in the same cell for each attribute. This bitmap index can improve the performance in case that a categorical data is skewed. Our evaluation experiments showed that proposed algorithms can achieve better performance than the existing pruning technique in the k-prototypes algorithm.
- 27 June 2018
- Published by MDPI AG in Preprints.org
Open AccessAn Efficient Grid-based K-prototypes Algorithm for Sustainable Decision Making Using Spatial Objects
Data mining plays a critical role in the sustainable decision making. The k-prototypes algorithm is one of the best-known algorithm for clustering both numeric and categorical data. Despite this, however, clustering a large number of spatial object with mixed numeric and categorical attributes is still inefficient due to its high time complexity. In this paper, we propose an efficient grid-based k-prototypes algorithms, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can remove unnecessary distance calculation. The second proposed algorithm as extensions of the first proposed algorithm utilizes spatial dependence that spatial data tend to be more similar as objects are closer. Each cell has a bitmap index which stores categorical values of all objects in the same cell for each attribute. This bitmap index can improve the performance in case that a categorical data is skewed. Our evaluation experiments showed that proposed algorithms can achieve better performance than the existing pruning technique in the k-prototypes algorithm.
- 1 November 2017
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 9 (4) , 1259-1265
User-Qualified Group Search using Bidirectional Sweep Planes
- 1 November 2017
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 9 (4) , 1259-1265
User-Qualified Group Search using Bidirectional Sweep Planes
- 17 August 2017
- Published by Springer Nature in Soft Computing
- Vol. 22 (13) , 4241-4249
Automatic scoring system for short descriptive answer written in Korean using lexico-semantic pattern
- 17 August 2017
- Published by Springer Nature in Soft Computing
- Vol. 22 (13) , 4241-4249
Automatic scoring system for short descriptive answer written in Korean using lexico-semantic pattern
- 18 December 2015
- Published by Springer Nature
- p. 797-803
In-Memory Processing for Nearest User-Specified Group Search
- 18 December 2015
- Published by Springer Nature
- p. 797-803
In-Memory Processing for Nearest User-Specified Group Search
- 1 January 2014
- Published by Springer Nature
- p. 433-440
Towards Nearest Collection Search on Spatial Databases
- 1 January 2014
- Published by Springer Nature
- p. 433-440
Towards Nearest Collection Search on Spatial Databases
- 1 August 2013
- Published by Springer Nature in Telecommunication Systems
- Vol. 55 (1) , 55-69
Parallel approach for processing itinerary-based RNN queries in object tracking WSNs
- 1 August 2013
- Published by Springer Nature in Telecommunication Systems
- Vol. 55 (1) , 55-69
Parallel approach for processing itinerary-based RNN queries in object tracking WSNs