Kisung Park

Orcid: 0000-0003-0858-3389

Affiliations:
  • Kyung Hee University, Yongin-si, South Korea


According to our database1, Kisung Park authored at least 13 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
An effective graph summarization and compression technique for a large-scaled graph.
J. Supercomput., 2020

ProcAnalyzer: Effective Code Analyzer for Tuning Imperative Programs in SAP HANA.
Proceedings of the 2020 International Conference on Management of Data, 2020

2019
Iterative Query Processing based on Unified Optimization Techniques.
Proceedings of the 2019 International Conference on Management of Data, 2019

2017
Disk-based shortest path discovery using distance index over large dynamic graphs.
Inf. Sci., 2017

2016
iTri: Index-based triangle listing in massive graphs.
Inf. Sci., 2016

2015
Distance-Constraint <i>k</i>-Nearest Neighbor Searching in Mobile Sensor Networks.
Sensors, 2015

Topological Similarity-Based Feature Selection for Graph Classification.
Comput. J., 2015

Correlated subgraph search for multiple query graphs in graph streams.
Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, 2015

2014
Activity Graph Feature Selection for Activity Pattern Classification.
Int. J. Distributed Sens. Networks, 2014

RDB2RDF: completed transformation from relational database into RDF ontology.
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication, 2014

Distributed K-Distance Indexing Approach for Efficient Shortest Path Discovery on Large Graphs.
Proceedings of the Database Systems for Advanced Applications, 2014

2013
Semi-supervised feature selection using co-occurrent frequent subgraphs.
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, 2013

An Efficient Method for Computing Similarity Between Frequent Subgraphs.
Proceedings of the 2013 International Conference on Cloud and Green Computing, Karlsruhe, Germany, September 30, 2013


  Loading...