• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.185-190
• /
• 2009

The event sequence of the same type from a set of events having time property can be summarized in one event. But if the event sequence having an interval, It is reasonable to be summarized more than one in independent sub event sequence of each other. In this paper, we suggest a method of temporal data mining that summarizes the interval events based on Allen's interval algebra and finds out interval event association rule from interval events. It provides better knowledge than others by using concept of an independent sub sequence and finding interval event association rules.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.91-98
• /
• 2004

DHP mining association rules algorithm maintains previously independent direct hash table to reduce the sire of hash tree containing the frequency number of each candidate large itemset. It performs pruning by using the direct hash table when the hash tree is constructed. The mort large the size of direct hash table increases, the higher the effort of pruning becomes. Especially, the effect of pruning in phase 2 which generate 2-large itemsets is so high that it dominates the overall performance of DHP algorithm. So, following the speedy trends of producing VLM(Very Large Memory) systems, extreme increment of direct hash table size is being tried and one of those trials is perfect hash table in phase 2. In case of using perfect hash table in phase 2, we found that some rearrangement of DHP algorithm got about 20% performance improvement compared to simply ｜H$_2$｜ reconfigured DHP algorithm. In this paper, we examine the feasibility of perfect hash table in phase 2 and propose PHP algorithm, a rearranged DHP algorithm, which uses the characteristics of perfect hash table sufficiently, then make an analysis on the results in experimental environment.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.27-32
• /
• 2004

If the areas existing in an object are composed of different color sets, the applicable object is segmented into independent areas so it gets to lose the meaning as an object. Therefore, it is required to selectively apply other information on the areas in addition to color information. Based on this methodology, this study, in addition to color information, has also analyzed the shape of isophotes that connect equivalence of brightness as a way of expressing cubic effect. And, through the analyzed information, it has judges independence or dependence of the areas, and then, proposed a way of object separation through significant regional matching of an object.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.2
• /
• pp.82-95
• /
• 1998

In this paper, we propose a text-independent speaker identification system which has a classifier composed of two parts; to calculate the degree of likeness of each speech frame and to select the most probable speaker from the entire speech duration. The first part is realized using RBFN which is selforganized through learning and in the second part the speaker is determined using a con-tbination of MAXNET and delayed summings. And we use features from linear speech production model and features from fractal geometry. Closed-set speaker identification experiments on 13 male homogeneous speakers show that the proposed techniques can achieve the identification ratio of 100% as the number of delays increases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.76-78
• /
• 2014

Naive Bayes (NB, for shortly) learning is more popular, faster and effective supervised learning method to handle the labeled datasets especially in which have some noises, NB learning also has well performance. However, the conditional independent assumption of NB learning imposes some restriction on the property of handling data of real world. Some researchers proposed lots of methods to relax NB assumption, those methods also include attribute weighting, kernel density estimating. In this paper, we propose a novel approach called NB Based on Attribute Weighting in Kernel Density Estimation (NBAWKDE) to improve the NB learning classification ability via combining kernel density estimation and attribute weighting.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.20-30
• /
• 2003

In a conventional method based on quadrature 2D Gator wavelets to extract iris features, the iris recognition is performed by a 256-byte iris code, which is computed by applying the Gabor wavelets to a given area of the iris. However, there is a code redundancy because the iris code is generated by basis functions without considering the characteristics of the iris texture. Therefore, the size of the iris code is increased unnecessarily. In this paper, we propose a new feature extraction algorithm based on the ICA (Independent Component Analysis) for a compact iris code. We implemented the ICA to generate optimal basis functions which could represent iris signals efficiently. In practice the coefficients of the ICA expansions are used as feature vectors. Then iris feature vectors are encoded into the iris code for storing and comparing an individual's iris patterns. Additionally, we introduce two methods to enhance the recognition performance of the ICA. The first is to reorganize the ICA bases and the second is to use a different ICA bases set. Experimental results show that our proposed method has a similar EER (Equal Error Rate) as a conventional method based on the Gator wavelets, and the iris code size of our proposed methods is four times smaller than that of the Gabor wavelets.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.1
• /
• pp.7-15
• /
• 2009

In this paper, a novel framework that synthesizes and clones facial expression in parameter spaces is presented. To overcome the difficulties in manipulating face geometry models with high degrees of freedom, many parameterization methods have been introduced. In this paper, a data-driven parameterization method is proposed that represents a variety of expressions with a small set of fundamental independent movements based on the ICA technique. The face deformation due to the parameters is also learned from the data to capture the nonlinearity of facial movements. With this parameterization, one can control the expression of an animated character's face by the parameters. By separating the parameterization and the deformation learning process, we believe that we can adopt this framework for a variety applications including expression synthesis and cloning. The experimental result demonstrates the efficient production of realistic expressions using the proposed method.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.135-147
• /
• 2001

This study proposes bankruptcy prediction model using fuzzy neural networks. Neural networks offer preeminent learning ability but they are often confronted with the inconsistent and unpredictable performance for noisy financial data. The existence of continuous data and large amounts of records may pose a challenging task to explicit concepts extraction from the raw data due to the huge data space determined by continuous input variables. The attempt to solve this problem is to transform each input variable in a way which may make it easier fur neural network to develop a predictive relationship. One of the methods selected for this is to map each continuous input variable to a series of overlapping fuzzy sets. Appropriately transforming each of the inputs into overlapping fuzzy membership sets provides an isomorphic mapping of the data to properly constructed membership values, and as such, no information is lost. In addition, it is easier far neural network to identify and model high-order interactions when the data is transformed in this way. Experimental results show that fuzzy neural network outperforms conventional neural network for the prediction of corporate bankruptcy.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.65-72
• /
• 1994

An independent set of nodes is a set of nodes no two of which are joined by an edge. An independent set is called maximal if no more nodes can be added to the set without destroying its independence. The greatest number of maximal independent set is the maximum possible number of maximal independent set of a graph. We consider the greatest number of maximal independent set in connected graphs with fixed numbers of edges and nodes. For arbitrary number of nodes with a certain class of number of edges, we present the connected graphs with the greatest number of maximal independent set. For a given class of number of edges, the structure of graphs with the greatest number of maximal independent set is that the two components are completely joined; one consists of disjoint triangles as many as possible and the other is the complete graph with remaining nodes.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.705-710
• /
• 2006

인터넷의 성장과 함께 인터넷 상의 비디오 스트리밍은 콘텐츠 전달에 중요한 수단이 되었다. 기존의 비디오 전송 방식은 사용자 터미널에 하나의 압축된 비디오를 스트리밍하는 것이었으나 최근 다중 뷰 비디오 코딩은 다른 시각 각도에 비디오 스트리밍 서비스를 지원하는 새로운 어플리케이션이 되었다. 따라서 단일 비디오는 다른 초점을 갖는 여러 독립된 비디오 스트림으로 구성되며 이는 더 많은 대역폭을 요구한다. 하지만 시간에 따라 네트워크의 대역폭이 변하는 경우, 계획된 비트율에 따라 콘텐츠의 비트량을 조절하여 양질의 콘텐츠 제공을 보장하기 어렵다. 따라서 트랜스코딩은 가변적인 네트워크의 대역폭에 적응하기 위한 필수적인 처리 단계가 되었다. 본 논문에서는 동시에 다중 비디오의 선택 및 트랜스코딩을 함께 고려하는 최적화 방법을 기반으로 한 스트리밍 다중 뷰 비디오의 최적 적응 프래임워크를 제안한다. 최적화된 비디오 스트림의 집합은 네트워크 대역폭, 트랜스코딩 코스트와 같은 제한을 만족하고 최적의 인지적 화질을 갖도록 선택되거나 트랜스코딩될 수 있으며 이는 MCKP로 모델링될 수 있다. 또한 트랜스코딩시 R-D 커브 상에 최적의 점을 얻기 위해 분리계획법이 적용하며 결과를 비교 분석한다.