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

Song B. Park

dblp:53/9382 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1986
—ORCID · none

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

Artificial intelligence and machine learning · 3Applied, 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.

Artificial intelligence
4 papers
Learning theory · 56% Kernel, tree and ensemble methods · 25% Probabilistic and Bayesian machine learning · 19%
Theoretical computer science
2 papers
Algorithms and data structures · 46% Computational geometry · 46% Mathematical optimization · 9%
Computer graphics and multimedia
1 paper
Image and video processing · 88% Audio and music processing · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › classification
classifier design
0.021986
Comments on "An Automated Approach to the Design of Decision Tree Classifiers" · IEEE Trans. Pattern Anal. Mach. Intell. 1986
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition · IEEE Trans. Pattern Anal. Mach. Intell. 1986
Machine learning › Kernel, tree and ensemble methods › decision tree
decision tree classifiers
0.011986
Comments on "An Automated Approach to the Design of Decision Tree Classifiers" · IEEE Trans. Pattern Anal. Mach. Intell. 1986
Machine learning › Learning theory › classification
nonparametric classification
0.011986
A fast nonparametric pattern classification scheme · Proc. IEEE 1986
Algorithms and data structures › similarity search
nearest neighbor search
0.011986
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition · IEEE Trans. Pattern Anal. Mach. Intell. 1986
Computational geometry
spatial data structures
0.011986
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition · IEEE Trans. Pattern Anal. Mach. Intell. 1986
Machine learning › Learning theory
statistical estimation
0.011983
Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Image and video processing
image filtering
0.011983
Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Image and video processing › image filtering
recursive filtering
0.011983
Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Machine learning › Kernel, tree and ensemble methods › nearest neighbor methods
nearest neighbor classifier
0.011986
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition · IEEE Trans. Pattern Anal. Mach. Intell. 1986
Image and video processing
image restoration
0.011983
Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Audio and music processing › speech enhancement
noise reduction
0.011983
Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Mathematical optimization
statistical estimation
0.011983
Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification · IEEE Trans. Pattern Anal. Mach. Intell. 1983

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

stochastic approximation · 0.0asymmetric half-plane ARMA model · 0.0ordered partition · 0.0distance computation pruning · 0.0statistical classification · 0.0parallelpipes · 0.0exhaustive search · 0.0class partition · 0.0
YearPublicationVenuePosition
1986 Comments on "An Automated Approach to the Design of Decision Tree Classifiers"
abstract
The above paper1 provides an automated technique for decision tree design which relies only on a priori statistics. The technique is basically to find a partition of the class set which maximizes the probability of correct classification at a given decision node. To do so, in the above paper1 all the possible partitions are searched exhaustively. In the present comment it is pointed out that the search for the partitions with a size of two is sufficient, and the higher order of partitions need not be searched.
Baek S. Kim, Song B. Park
IEEE Trans. Pattern Anal. Mach. Intell.2
1986 A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
abstract
We propose a fast nearest neighbor finding algorithm, named tentatively an ordered partition, based on the ordered lists of the training samples of each projection axis. The ordered partition contains two properties, one is ordering¿to bound the search region, and the other is partitioning¿to reject the unwanted samples without actual distance computations. It is proved that the proposed algorithm can find k nearest neighbors in a constant expected time. Simulations show that the algorithm is rather distribution free, and only 4.6 distance calculations, on the average, were required to find a nearest neighbor among 10 000 samples drawn from a bivariate normal distribution.
Baek S. Kim, Song B. Park
IEEE Trans. Pattern Anal. Mach. Intell.2
1986 A fast nonparametric pattern classification scheme
abstract
In this letter we propose a method to represent the decision region in pattern recognition by a set of open parallelpipes within each of which some statistical property is satisfied. The proposed method has the following advantages: 1) it results in a great reduction of classification time, and 2) a priori knowledge can be easily incorporated in the decision rule.
Baek S. Kim, Song B. Park
Proc. IEEE2
1983 Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification
abstract
A two-dimensional recursive estimation algorithm based on the asymmetric half-plane model is described for the problem of MMSE (minimum mean-square error) filtering. The optimum filtering problem is solved by formulating the asymmetric half-plane ARMA (autoregressive moving average) model for two-dimensional data. The sequential parameter identification from the noisy two-dimensional data is also discussed, utilizing the stochastic approximation. Experiments were performed for real image data, combining the proposed parameter identification and estimation algorithms. The results show that this method gives considerable improvement in SNR.
Young-Ho Yum, Song B. Park
IEEE Trans. Pattern Anal. Mach. Intell.2