• Journal of KIISE:Software and Applications
• /
• v.35 no.8
• /
• pp.463-478
• /
• 2008

Due to the high dimensional problem, typically machine learning algorithms have relied on feature selection techniques in order to perform effective classification in microarray gene expression datasets. However, the large number of features compared to the number of samples makes the task of feature selection computationally inprohibitive and prone to errors. One of traditional feature selection approach was feature filtering; measuring one gene per one step. Then feature filtering was an univariate approach that cannot validate multivariate correlations. In this paper, we proposed a function for measuring both class separability and correlations. With this approach, we solved the problem related to feature filtering approach.

• Journal of Korea Technology Innovation Society
• /
• v.10 no.4
• /
• pp.605-628
• /
• 2007

We analyze the embedded structure of the cooperative research network of innovation studies in Korea by employing the social network methodology. The network covers all the contributing authors of two journals such as JTI and KTIS, which are the representative journals in the area. Across the networks, the following is noted: networks are highly segmented and the link density is low. However, the KTIS network contains a huge component with 131 authors which implies the existence of a strong cooperative research infrastructure. We derived three sub-networks such as technology economics, technology management, and technology policy. The technology policy network has the lowest link density, while the technology management network of KTIS shows relatively high cohesion among the researchers. Simulation analysis for the mean links of networks by author affiliation divided into university and others show no significant difference between the two networks. We also found a higher ratio of linkage within affiliated network than between networks, rejecting our hypothesis that researchers will not discriminate their research partners due to strong governmental inducement of academia-res each-industry cooperation. The explainability of indices from network structure such as structural holes and clustering coefficients on the performance of researchers measured by the number of citations confirms the results reported in Oh, Choi & Kim (2006) which dealt with the research network of information systems.

• Journal of Korea Port Economic Association
• /
• v.30 no.4
• /
• pp.151-168
• /
• 2014

The purpose of this paper is to show the brief efficiency and clustering measurement way by using the game cross-efficiency model which is newly introduced in this paper for 13 container ports during 3 years(2009, 2010, and 2013) with 3 input variables(depth, total area, and number of crane) and 1 output variable(container TEU). The main empirical results are as follows. First, the average rankings of game cross-efficiency model are Ningbo, Hongkong, Shanghai, Dubai, Singapore, Qingdao, Kaosiung, Busan, Tokyo, Incheon, Nagoya, Manila, Gwangyang ports in order. Second, according to ANOVA analysis, three models show the similar results in terms of the efficiency rankings. Third, in the clustering analysis using dendrogram, group A(Shangahi and Busan), group B(Ningbo and Nagoya), and group C(Incheon and Manila) show the common clustering ports during 3 or 2 years. The policy implication of this paper is that Korean port policy planner should introduce the game cross-efficiency method when measuring the individual port efficiency. Also port authority should consider the merits of the clustering ports for improving the port management and operations.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1857-1858
• /
• 2008

본 논문에서는 FCM 기반 RBF 뉴럴네트워크(FCM-RBFNN) 구조를 제안하고 PSO를 이용한 FCM-RBFNN의 구조 및 파라미터의 최적화 방법을 제시한다. 클러스터링 알고리즘은 퍼지 뉴럴 네트워크에서 멤버쉽함수의 중심점과 반경 등을 결정하는 학습에 일반적으로 사용된다. 제안된 FCM-RBFNN서는 방사기저함수로써 가우시안, 삼각형 타입 등의 정해진 형태를 사용하지 않고 데이터들 사이의 거리에 관계된 계산을 수행하는 FCM에 의해 결정된다. 기존의 RBFNN에서 후반부는 상수형태로써 방사기저함수의 선형결합으로써 표현되는 반면에 제안된 FCM-RBFNN의 후반부는 상수형, 선형, 2차식 등의 다양한 형태의 다항식으로 표현될 수 있으며 다항식의 계수는 WLSE를 이용하여 추정한다. FCM 기반 RBF 뉴럴 네트워크의 성능은 퍼지규칙의 수, 후반부 다항식의 차수 FCM의 퍼지화 계수에 의하여 결정기 때문에 FCM-RBFNN의 구조와 파라미터의 최적화가 요구된다. 본 논문에서는 PSO를 이용하여 FCM-RBFNN의 구조에 관련된 퍼지 규칙의 수, 후반부 다항식의 차수와 파라미터에 관련된 퍼지화 계수를 최적화한다. 또한 후반부 다항식의 계수는 WLSE를 사용하여 추정한다.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1044-1056
• /
• 2013

This paper presents an approach for detecting and measuring human skin pigmentation. In the proposed scheme, we extract a skin area by a GMM-EM clustering based skin color model that is estimated from the statistical analysis of training images and remove tiny noises through the morphology processing. A skin area is decomposed into two components of hemoglobin and melanin by an independent component analysis (ICA) algorithm. Then, we calculate the intensities of hemoglobin and melanin by using the projection transformed block coefficient and determine the existence of skin pigmentation according to the global and local distribution of two intensities. Furthermore, we measure the area and density of the detected skin pigmentation. Experimental results verified that our scheme can both detect the skin pigmentation and measure the quantity of that and also our scheme takes less time because of the location histogram.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.3
• /
• pp.132-136
• /
• 2014

We introduce a new architecture of TSK-based fuzzy inference system. The proposed model used fuzzy c-means clustering method(FCM) for efficient disposal of data. The premise part of fuzzy rules don't assume any membership function such as triangular, gaussian, ellipsoidal because we construct the premise part of fuzzy rules using FCM. As a result, we can reduce to architecture of model. In this paper, we are able to use four types of polynomials as consequence part of fuzzy rules such as simplified, linear, quadratic, modified quadratic. Weighed Least Square Estimator are used to estimates the coefficients of polynomial. The proposed model is evaluated with the use of Boston housing data called Machine Learning dataset.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.735-740
• /
• 2012

In this paper, we introduce design methodologies of polynomial radial basis function neural network classifier with the aid of Principal Component Analysis(PCA) and Linear Discriminant Analysis(LDA). By minimizing the information loss of given data, Feature data is obtained through preprocessing of PCA and LDA and then this data is used as input data of RBFNNs. The hidden layer of RBFNNs is built up by Fuzzy C-Mean(FCM) clustering algorithm instead of receptive fields and linear polynomial function is used as connection weights between hidden and output layer. In order to design optimized classifier, the structural and parametric values such as the number of eigenvectors of PCA and LDA, and fuzzification coefficient of FCM algorithm are optimized by Artificial Bee Colony(ABC) optimization algorithm. The proposed classifier is applied to some machine learning datasets and its result is compared with some other classifiers.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.970-976
• /
• 2007

In this study, Polynomial Network Pattern Classifier(PNC) based on Fuzzy Inference Mechanism is designed and its parameters such as learning rate, momentum coefficient and fuzzification coefficient are optimized by means of Particle Swarm Optimization. The proposed PNC employes a partition function created by Fuzzy C-means(FCM) clustering as an activation function in hidden layer and polynomials weights between hidden layer and output layer. Using polynomials weights can help to improve the characteristic of the linear classification of basic neural networks classifier. In the viewpoint of linguistic analysis, the proposed classifier is expressed as a collection of "If-then" fuzzy rules. Namely, architecture of networks is constructed by three functional modules that are condition part, conclusion part and inference part. The condition part relates to the partition function of input space using FCM clustering. In the conclusion part, a polynomial function caries out the presentation of a partitioned local space. Lastly, the output of networks is gotten by fuzzy inference in the inference part. The proposed PNC generates a nonlinear discernment function in the output space and has the better performance of pattern classification as a classifier, because of the characteristic of polynomial based fuzzy inference of PNC.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.35-43
• /
• 2013

As texture images have become prevalent throughout a variety of industrial applications, copyright protection of these images has become important issues. For this reason, this paper proposes a color-texture image watermarking algorithm utilizing texture properties inherent in the image. The proposed algorithm selects suitable blocks to embed a watermark using the energy and homogeneity properties of the grey level co-occurrence matrices as inputs for the fuzzy c-means clustering algorithm. To embed the watermark, we first perform a discrete wavelet transform (DWT) on the selected blocks and choose one of DWT subbands. Then, we embed the watermark into discrete cosine transformed blocks with a gain factor. In this study, we also explore the effects of the DWT subbands and gain factors with respect to the imperceptibility and robustness against various watermarking attacks. Experimental results show that the proposed algorithm achieves higher peak signal-to-noise ratio values (47.66 dB to 48.04 dB) and lower M-SVD values (8.84 to 15.6) when we embedded a watermark into the HH band with a gain factor of 42, which means the proposed algorithm is good enough in terms of imperceptibility. In addition, the proposed algorithm guarantees robustness against various image processing attacks, such as noise addition, filtering, cropping, and JPEG compression yielding higher normalized correlation values (0.7193 to 1).

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.119-124
• /
• 2002

Clustering of data is of a great interest in many data mining applications. In the field of document clustering, a document is represented as a data in a high dimensional space. Therefore, the document clustering can be accomplished with a general data clustering techniques. In this paper, we introduce a document clustering system based on similarity among documents. The developed system consists of three functions: 1) gatherings documents utilizing a search agent; 2) determining similarity coefficients between any two documents from term frequencies; 3) clustering documents with similarity coefficients. Especially, the document clustering is accomplished by a hybrid algorithm utilizing genetic and K-Means methods.