Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Sung-Bae Cho is active.

Publication


Featured researches published by Sung-Bae Cho.


systems man and cybernetics | 1995

Combining multiple neural networks by fuzzy integral for robust classification

Sung-Bae Cho; Jin H. Kim

In the area of artificial neural networks, the concept of combining multiple networks has been proposed as a new direction for the development of highly reliable neural network systems. The authors propose a method for multinetwork combination based on the fuzzy integral. This technique nonlinearly combines objective evidence, in the form of a fuzzy membership function, with subjective evaluation of the worth of the individual neural networks with respect to the decision. The experimental results with the recognition problem of on-line handwriting characters confirm the superiority of the presented method to the other voting techniques. >


ubiquitous intelligence and computing | 2007

Location-based recommendation system using Bayesian user's preference model in mobile devices

Moon-Hee Park; Jin-Hyuk Hong; Sung-Bae Cho

As wireless communication advances, research on location-based services using mobile devices has attracted interest, which provides information and services related to users physical location. As increasing information and services, it becomes difficult to find a proper service that reflects the individual preference at proper time. Due to the small screen of mobile devices and insufficiency of resources, personalized services and convenient user interface might be useful. In this paper, we propose a map-based personalized recommendation system which reflects users preference modeled by Bayesian Networks (BN). The structure of BN is built by an expert while the parameter is learned from the dataset. The proposed system collects context information, location, time, weather, and user request from the mobile device and infers the most preferred item to provide an appropriate service by displaying onto the mini map.


Engineering Applications of Artificial Intelligence | 2000

Application of interactive genetic algorithm to fashion design

Hee-Su Kim; Sung-Bae Cho

Abstract In general, computer-aided design support systems have got an approach of traditional artificial intelligence, which statistically analyzes data such as the behavior of designer, to extract formal design behavior. This approach, however, can neither deal with continuous change of fashion nor reflect personal taste well, as it just depends on large amount of collected data. To overcome this sort of problem interactive genetic algorithm (IGA) has been recently proposed, as a new trend of evolutionary computation. IGA uses humans response as fitness value when the fitness function cannot be explicitly defined. This enables IGA to be applied to artistic domains, and we propose a fashion design aid system using it. Unlike the previous works that attempt to model the dress design by several spline curves, the proposed system is based on a new encoding scheme that practically describes a dress with three parts: body and neck, sleeve, and skirt. By incorporating the domain-specific knowledge into the genotype, we could develop a more realistic design aid system for women’s dress. We have implemented the system with OpenGL and VRML to enhance the system interface. The experiments with several human subjects show that the IGA approach to dress design aid system is promising.


Archive | 2011

Hybrid Artificial Intelligent Systems

Emilio Corchado; Václav Snášel; Ajith Abraham; Michał Woźniak; Manuel Graña; Sung-Bae Cho

This paper deals with discovering frequent sets for quantitative association rules mining with preserved privacy. It focuses on privacy preserving on an individual level, when true individual values, e.g., values of attributes describing customers, are not revealed. Only distorted values and parameters of the distortion procedure are public. However, a miner can discover hidden knowledge, e.g., association rules, from the distorted data. In order to find frequent sets for quantitative association rules mining with preserved privacy, not only does a miner need to discretise continuous attributes, transform them into binary attributes, but also, after both discretisation and binarisation, the calculation of the distortion parameters for new attributes is necessary. Then a miner can apply either MASK (Mining Associations with Secrecy Konstraints) or MMASK (Modified MASK) to find candidates for frequent sets and estimate their supports. In this paper the methodology for calculating distortion parameters of newly created attributes after both discretisation and binarisation of attributes for quantitative association rules mining has been proposed. The new application of MMASK for finding frequent sets in discovering quantitative association rules with preserved privacy has been also presented. The application of MMASK scheme for frequent sets mining in quantitative association rules discovery on real data sets has been experimentally verified. The results of the experiments show that both MASK and MMASK can be applied in frequent sets mining for quantitative association rules with preserved privacy, however, MMASK gives better results in this task.


IEEE Transactions on Neural Networks | 1995

Multiple network fusion using fuzzy logic

Sung-Bae Cho; Jin H. Kim

Multiplayer feedforward networks trained by minimizing the mean squared error and by using a one of c teaching function yield network outputs that estimate posterior class probabilities. This provides a sound basis for combining the results from multiple networks to get more accurate classification. This paper presents a method for combining multiple networks based on fuzzy logic, especially the fuzzy integral. This method non-linearly combines objective evidence, in the form of a network output, with subjective evaluation of the importance of the individual neural networks. The experimental results with the recognition problem of on-line handwriting characters show that the performance of individual networks could be improved significantly.


IEEE Transactions on Neural Networks | 1997

Neural-network classifiers for recognizing totally unconstrained handwritten numerals

Sung-Bae Cho

Artificial neural networks have been recognized as a powerful tool for pattern classification problems, but a number of researchers have also suggested that straightforward neural-network approaches to pattern recognition are largely inadequate for difficult problems such as handwritten numeral recognition. In this paper, we present three sophisticated neural-network classifiers to solve complex pattern recognition problems: multiple multilayer perceptron (MLP) classifier, hidden Markov model (HMM)/MLP hybrid classifier, and structure-adaptive self-organizing map (SOM) classifier. In order to verify the superiority of the proposed classifiers, experiments were performed with the unconstrained handwritten numeral database of Concordia University, Montreal, Canada. The three methods have produced 97.35%, 96.55%, and 96.05% of the recognition rates, respectively, which are better than those of several previous methods reported in the literature on the same database.


Computers & Security | 2003

Efficient anomaly detection by modeling privilege flows using hidden Markov model

Sung-Bae Cho; Hyuk-Jang Park

Anomaly detection techniques have been devised to address the limitations of misuse detection approaches for intrusion detection with the model of normal behaviors. A hidden Markov model (HMM) is a useful tool to model sequence information, an optimal modeling technique to minimize false-positive error while maximizing detection rate. In spite of high performance, however, it requires large amounts of time to model normal behaviors and determine intrusions, making it difficult to detect intrusions in real-time. This paper proposes an effective HMM-based intrusion detection system that improves the modeling time and performance by only considering the privilege transition flows based on the domain knowledge of attacks. Experimental results show that training with the proposed method is significantly faster than the conventional method trained with all data, without loss of detection performance.


congress on evolutionary computation | 2001

An efficient genetic algorithm with less fitness evaluation by clustering

Hee-Su Kim; Sung-Bae Cho

To solve a general problem with genetic algorithms, it is desirable to maintain the population size as large as possible. In some cases, however, the cost to evaluate each individual is relatively high, and it is difficult to maintain a large population. To solve this problem, we propose a hybrid GA based on clustering, which considerably reduces the evaluation number without any loss of performance. The algorithm divides the whole population into several clusters, and evaluates only one representative for each cluster. The fitness values of other individuals are estimated from the representative fitness values indirectly, which can maintain a large population with less number of evaluations. Several benchmark tests have been conducted and the results show that the proposed GA is very efficient.


hybrid artificial intelligence systems | 2011

Activity recognition using hierarchical hidden markov models on a smartphone with 3D accelerometer

Young-Seol Lee; Sung-Bae Cho

As smartphone users have been increased, studies using mobile sensors on smartphone have been investigated in recent years. Activity recognition is one of the active research topics, which can be used for providing users the adaptive services with mobile devices. In this paper, an activity recognition system on a smartphone is proposed where the uncertain time-series acceleration signal is analyzed by using hierarchical hidden Markov models. In order to address the limitations on the memory storage and computational power of the mobile devices, the recognition models are designed hierarchy as actions and activities. We implemented the real-time activity recognition application on a smartphone with the Google android platform, and conducted experiments as well. Experimental results showed the feasibility of the proposed method.


systems man and cybernetics | 2005

Evolutionary neural networks for anomaly detection based on the behavior of a program

Sang-Jun Han; Sung-Bae Cho

The process of learning the behavior of a given program by using machine-learning techniques (based on system-call audit data) is effective to detect intrusions. Rule learning, neural networks, statistics, and hidden Markov models (HMMs) are some of the kinds of representative methods for intrusion detection. Among them, neural networks are known for good performance in learning system-call sequences. In order to apply this knowledge to real-world problems successfully, it is important to determine the structures and weights of these call sequences. However, finding the appropriate structures requires very long time periods because there are no suitable analytical solutions. In this paper, a novel intrusion-detection technique based on evolutionary neural networks (ENNs) is proposed. One advantage of using ENNs is that it takes less time to obtain superior neural networks than when using conventional approaches. This is because they discover the structures and weights of the neural networks simultaneously. Experimental results with the 1999 Defense Advanced Research Projects Agency (DARPA) Intrusion Detection Evaluation (IDEVAL) data confirm that ENNs are promising tools for intrusion detection.

Collaboration


Dive into the Sung-Bae Cho's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Jin-Hyuk Hong

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge