• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2399-2413
• /
• 2021

A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.

• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.7-18
• /
• 2003

Due to the changes of shipping and logistic environment, Asian ports today face severe competition. To be a mega-hub port, Asian ports have achieved a big scale development. For these reasons, it has been widely recognized as an important study to analyze and evaluate characteristics of Asian ports, from the standpoint of Korea where Busan Port is located. Although some previous studies have been reported, most of them have been beyond the scope of Asian ports and analyzed the world's major ports; moreover, the studied ports have been about the ports which are well known from the previous research and reports. So, most studies is unlikely to be used as substantial indicators from the perspective of Busan Port. In addition. most of the existing studies have used hierarchical evaluation algorithm for port ranking, such as AHP (analytical hierarchy process) and clustering analysis. However, these two methods have fundamental weaknesses from the algorithm perspective. The aim of this study is to classify major Asian ports based on competitiveness level. Especially. in order to overcome serious problem of the existing studies, major Asian ports were analyzed by using objective indicators. and Fuzzy C-Means algorithm, which alleviates the weakness of the clustering method. It was found that 10 ports of 16 major Asian ports have their own phases and were classified into 4 port groups. This result implies that some ports have higher potential as ports to lead some zones in Asia. Based on those results. present status and future direction of Busan port were discussed as well.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.3
• /
• pp.185-191
• /
• 2007

Remote sensing images are multispectral image data collected from several band divided by wavelength ranges. The classification of remote sensing images is the method of classifying what has similar spectral characteristics together among each pixel composing an image as the important algorithm in this field. This paper presents a pattern classification method of remote sensing images by applying a possibilistic fuzzy c-means (PFCM) algorithm. The PFCM algorithm is a hybridization of a FCM algorithm, which adopts membership degree depending on the distance between data and the center of a certain cluster, combined with a PCM algorithm, which considers class typicality of the pattern sets. In this proposed method, we select the training data for each class and perform supervised classification using the PFCM algorithm with spectral signatures of the training data. The application of the PFCM algorithm is tested and verified by using Landsat TM and IKONOS remote sensing satellite images. As a result, the overall accuracy showed a better results than the FCM, PCM algorithm or conventional maximum likelihood classification(MLC) algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.1
• /
• pp.18-23
• /
• 2008

A FCM with locational price and regional information between locations are proposed in this paper. Any point in a networked system has its own values indicating the physical characteristics of that networked system and regional information at the same time. The similarity measure used for FCM in this paper is defined through the system-wide characteristic values at each point. To avoid the grouping of geometrically distant locations with similar measures, the locational information are properly considered and incorporated in the proposed similarity measure. We have verified that the proposed measure has produced proper classification of a networked system, followed by an example of a networked electricity system.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.441-449
• /
• 2007

In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.37-38
• /
• 2011

본 논문은 상대적으로 대비도 차이가 크게 나타나는 역광 이미지에 대해서 Retinex 알고리즘을 적용하여 보정 했을 경우 발생하는 밝은 영역에서의 컬러 성분의 손실을 개선하기 위한 새로운 기법을 제안한다. 역광 이미지의 경우 밝은 영역과 어두운 영역에 대한 밝기 차이가 매우 크게 발생하기 때문에 Retinex 알고리즘을 이용하여 영상의 대비도를 향상시킬 경우 밝은 영역에서의 컬러 성분이 손실되는 현상이 발생한다. 이러한 손실을 보완하기 위해서 원본 영상의 밝은 영역에 해당하는 컬러 성분을 Retinex 알고리즘으로 보정된 영상에 추가해준다. Fuzzy c-means 군집화 알고리즘을 이용하여 원본 영상에서의 밝은 영역과 어두운 영역에 대하여 모든 화소의 소속 정도를 나타내는 퍼지 소속 함수를 구한다. 밝은 영역에 대해서의 컬러 성분은 원본 영상 값에 밝은 영역 퍼지 소속 함수를 적용하고, 어두운 영역에 대해서의 컬러 성분은 Retinex 복원 영상 값에 어두운 영역 퍼지 소속 함수를 이용한다. 제안하는 알고리즘의 성능 평가를 위해 역광 현상이 강하게 나타나는 자연영상들을 대상으로 적용하여 기존의 Retinex 알고리즘(MSRCR) 보다 우수한 성능을 가지고 있음을 보였다.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.159-162
• /
• 2000

In this paper, we propose an efficient method to detect shot changes in compressed MPEG video data by using reference features among video frames. The reference features among video frames imply the similarities among adjacent frames by prediction coded type of each frame. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. And the shot change detection algorithm is improved by using Fuzzy c-means (FCM) clustering algorithm. The FCM clustering algorithm uses the shot change probabilities evaluated in the mask matching of reference ratios and difference measure values based on frame reference ratios.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.5
• /
• pp.529-535
• /
• 2014

In this paper, we propose a hybrid approach towards multiple kernels interval type-2 possibilistic fuzzy C-means(PFCM) based on interval type-2 possibilistic fuzzy c-means(IT2PFCM) and possibilistic fuzzy c-means using multiple kernels( PFCM-MK). In case of noisy data or overlapping cluster prototypes, fuzzy C-means gives poor performance in comparison to possibilistic fuzzy C-means(PFCM). Moreover, to address the uncertainty associated with fuzzifier parameter m, interval type-2 possibilistic fuzzy C-means(PFCM) is used. Most of the practical data available are complex and non-linearly separable. In such cases using Gaussian kernels proves helpful. Therefore, in order to overcome all these issues, we have integrated multiple kernels possibilistic fuzzy C-means(PFCM) into interval type-2 possibilistic fuzzy C-means(IT2PFCM) and propose the idea of multiple kernels based interval type-2 possibilistic fuzzy C-means(IT2PFCM-MK).

• Structural Engineering and Mechanics
• /
• v.44 no.2
• /
• pp.179-196
• /
• 2012

An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

• Annual Conference of KIPS
• /
• 2000.10a
• /
• pp.751-754
• /
• 2000

In this paper, we propose an efficient method to detect abrupt shot changes in compressed MPEG video data by using reference ratios among video frames. The reference ratios among video frames imply the degree of similarities among adjacent frames by prediction coded type of each frames. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. This paper proposes an efficient shot change detection algorithm by using Fuzzy c-means(FCM) clustering algorithm. The FCM clustering uses the shot change probabilities evaluated in the mask matching of reference ratios and difference measure values based on frame reference ratios.