Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jong Ho Park

dblp:47/6273 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › event extraction
event detection
0.412019
Literary Event Detection · ACL (1) 2019
Natural language and speech › Information extraction and text analysis › document analysis
literary text analysis
0.112019
Literary Event Detection · ACL (1) 2019

Methods — techniques the papers use, named apart from their topics

bidirectional LSTM · 0.4BERT · 0.4
YearPublicationVenuePosition
2019 Literary Event Detection
abstract
In this work we present a new dataset of literary events—events that are depicted as taking place within the imagined space of a novel. While previous work has focused on event detection in the domain of contemporary news, literature poses a number of complications for existing systems, including complex narration, the depiction of a broad array of mental states, and a strong emphasis on figurative language. We outline the annotation decisions of this new dataset and compare several models for predicting events; the best performing model, a bidirectional LSTM with BERT token representations, achieves an F1 score of 73.9. We then apply this model to a corpus of novels split across two dimensions—prestige and popularity—and demonstrate that there are statistically significant differences in the distribution of events for prestige.
Matthew Sims, Jong Ho Park, David Bamman
ACL (1)2
2005 An Implementation of the Client-Based Distributed Web Caching System
Jong Ho Park, Kil To Chong 0001
APWeb1
2005 Neural Network Hot Spot Prediction Algorithm for Shared Web Caching System
Jong Ho Park, Sung Chil Jung, Changlei Zhang, Kil To Chong 0001
APWeb1
2004 A Simple Client-Based Hybrid Robust Hash Routing Web Caching System (2HRCS)
Jong Ho Park, Kil To Chong 0001
APWeb1