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

Seok-Ju Chun

dblp:51/5869 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
1since 2021 · last 2022
0000-0003-1299-1203ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 38% Query processing and optimization · 22% Indexing and storage engines · 22%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › range query
range-sum queries
0.012001
Dynamic Update Cube for Range-sum Queries · VLDB 2001
Information retrieval
similarity search
0.012000
Similarity Search for Multidimensional Data Sequences · ICDE 2000
Spatial and temporal data management › time series data management
subsequence matching
0.012000
Similarity Search for Multidimensional Data Sequences · ICDE 2000
Information retrieval › similarity search › sequence similarity search
time series similarity search
0.012000
Similarity Search for Multidimensional Data Sequences · ICDE 2000

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

pruning · 0.1partitioning · 0.1minimum bounding rectangle · 0.1
YearPublicationVenuePosition
2022 Sequential inter-hop graph convolution neural network (SIhGCN) for skeleton-based human action recognition
Feri Setiawan, Bernardo Nugroho Yahya, Seok-Ju Chun, Seok-Lyong Lee
Expert Syst. Appl.3
2010 Development and application of a web-based programming learning system with LED display kits
abstract
This paper describes a new programming learning system. It consists of a Web-based flowchart application and Light Emitting Diode (LED) display kits. The LED kits produce various animations or static images according to a flow chart. The flowchart tool allows students to manipulate program elements through a Graphical User Interface (GUI). Survey results show that the proposed system makes learning how to program less challenging and more interesting for beginners. Encouraged by these initial findings, the authors are developing a system with add-on features including sensor accessory options and compatibility with well known LEGO® products.
Seok-Ju Chun, Jungwoo Ryoo
SIGCSE1
2010 Effective processing of continuous group-by aggregate queries in sensor networks
Chun-Hee Lee, Chin-Wan Chung, Seok-Ju Chun
J. Syst. Softw.3
2006 Query Based Summarization Using Non-negative Matrix Factorization
Sun Park, Ju-Hong Lee, Chan-Min Ahn, Jun Sik Hong, Seok-Ju Chun
KES (3)5
2006 Online aggregation with tight error bounds in dynamic environments
Seok-Ju Chun, Ju-Hong Lee, Seok-Lyong Lee
Inf. Softw. Technol.1
2004 Space-efficient cubes for OLAP range-sum queries
Seok-Ju Chun, Chin-Wan Chung, Seok-Lyong Lee
Decis. Support Syst.1
2004 A compression method for prefix-sum cubes
Heum-Geun Kang, Jun-Ki Min, Seok-Ju Chun, Chin-Wan Chung
Inf. Process. Lett.3
2003 Selectivity Estimation for Optimizing Similarity Query in Multimedia Databases
Ju-Hong Lee, Seok-Ju Chun, Sun Park
IDEAL2
2003 Partial Prefix Sum Method for Large Data Warehouses
Seok-Ju Chun
ISMIS1
2001 Dynamic Update Cube for Range-sum Queries
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Lyong Lee
VLDB1
2000 Similarity Search for Multidimensional Data Sequences
abstract
Time series data, which are a series of one dimensional real numbers, have been studied in various database applications. We extend the traditional similarity search methods on time series data to support a multidimensional data sequence, such as a video stream. We investigate the problem of retrieving similar multidimensional data sequences from a large database. To prune irrelevant sequences in a database, we introduce correct and efficient similarity functions. Both data sequences and query sequences are partitioned into subsequences, and each of them is represented by a Minimum Bounding Rectangle (MBR). The query processing is based upon these MBRs, instead of scanning data elements of entire sequences. Our method is designed: (1) to select candidate sequences in a database, and (2) to find the subsequences of a selected sequence, each of which falls under the given threshold. The latter is of special importance in the case of retrieving subsequences from large and complex sequences such as video. By using it, we do not need to browse the whole of the selected video stream, but just browse the sub-streams to find a scene we want. We have performed an extensive experiment on synthetic, as well as real data sequences (a collection of TV news, dramas, and documentary videos) to evaluate our proposed method. The experiment demonstrates that 73-94 percent of irrelevant sequences are pruned using the proposed method, resulting in 16-28 times faster response time compared with that of the sequential search.
Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Hong Lee, Chin-Wan Chung
ICDE2