Ha-Myung Park

Orcid: 0000-0002-6421-8880

According to our database1, Ha-Myung Park authored at least 15 papers between 2013 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Proximity Search in Time-accumulating High-dimensional Data using Multi-level Block Indexing.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

Enhancing Heterophilic Graph Neural Network Performance Through Label Propagation in K-Nearest Neighbor Graphs.
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2024

Latent Representation Generation for Efficient Content-Based Image Retrieval in Weather Satellite Images Using Self-Supervised Segmentation.
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2024

2023
Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2021
Accurate relational reasoning in edge-labeled graphs by multi-labeled random walk with restart.
World Wide Web, 2021

2020
BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks.
Proceedings of the 23rd International Conference on Extending Database Technology, 2020

2018
Enumerating Trillion Subgraphs On Distributed Systems.
ACM Trans. Knowl. Discov. Data, 2018

PegasusN: A Scalable and Versatile Graph Mining System.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining.
CoRR, 2017

A New Question Answering Approach with Conceptual Graphs.
Proceedings of the COnférence en Recherche d'Informations et Applications, 2017

2016
The direction-constrained k nearest neighbor query - Dealing with spatio-directional objects.
GeoInformatica, 2016

PTE: Enumerating Trillion Triangles On Distributed Systems.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Partition Aware Connected Component Computation in Distributed Systems.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2014
MapReduce Triangle Enumeration With Guarantees.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
An efficient MapReduce algorithm for counting triangles in a very large graph.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013


  Loading...