• Title/Summary/Keyword: Modified k-means algorithm

Search Result 100, Processing Time 0.031 seconds

A Personalized Music Recommendation System with a Time-weighted Clustering (시간 가중치와 가변형 K-means 기법을 이용한 개인화된 음악 추천 시스템)

  • Kim, Jae-Kwang;Yoon, Tae-Bok;Kim, Dong-Moon;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.4
    • /
    • pp.504-510
    • /
    • 2009
  • Recently, personalized-adaptive services became the center of interest in the world. However the services about music are not widely diffused out. That is because the analyzing of music information is more difficult than analyzing of text information. In this paper, we propose a music recommendation system which provides personalized services. The system keeps a user's listening list and analyzes it to select pieces of music similar to the user's preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a piece of music is mapped into a point in the property space and the time is converted into the weight of the point. At this time, if we select and analyze the group which is selected by user frequently, we can understand user's taste. However, it is not easy to predict how many groups are formed. To solve this problem, we apply the K-means clustering algorithm to the weighted points. We modified the K-means algorithm so that the number of clusters is dynamically changed. This manner limits a diameter so that we can apply this algorithm effectively when we know the range of data. By this algorithm we can find the center of each group and recommend the similar music with the group. We also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the user's preference. We perform experiments with one hundred pieces of music. The result shows that our proposed algorithm is effective.

Adaptive Clustering Algorithm for Recycling Cell Formation: An Application of the Modified Fuzzy ART Neural Network

  • Park, Ji-Hyung;Seo, Kwang-Kyu
    • Proceedings of the Korea Database Society Conference
    • /
    • 1999.06a
    • /
    • pp.253-260
    • /
    • 1999
  • The recycling cell formation problem means that disposal products me classified into recycling part families using group technology in their end of life phase. Disposal products have the uncertainties of product status by usage influences during product use phase and recycling cells are formed design, process and usage attributes. In order to treat the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem far disposal products. In this paper, a heuristic approach fuzzy ART neural network is suggested. The modified fuzzy ART neural network is shown that it has a great efficiency and give an extension for systematically generating alternative solutions in the recycling cell formation problem. We present the results of this approach applied to disposal refrigerators and the comparison of performances between other algorithms. This paper introduced a procedure which integrates economic and environmental factors into the disassembly of disposal products for recycling in recycling cells. A qualitative method of disassembly analysis is developed and its ai is to improve the efficiency of the disassembly and to generated an optimal disassembly which maximize profits and minimize environmental impact. Three criteria established to reduce the search space and facilitate recycling opportunities.

  • PDF

Algorithm to prevent Block Discontinuity by Overlapped Block and Manning Window (중첩 기반 연산과 Hanning Window를 이용한 블록 불연속 노이즈 방지 알고리즘)

  • Kim, Joo-Hyun;Jang, Won-Woo;Park, Jung-Hwan;Yang, Hoon-Gee;Kang, Bong-Soon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.9
    • /
    • pp.1650-1657
    • /
    • 2007
  • In this paper, we propose an Overlapped Block and an Hanning Window to prevent a Block Discontinuity when we use an algorithm to eliminate ringing artifact which is based on a block structure. The algorithm to eliminate ringing artifact operates with a block structure and 24-RGB data and is based on a modified K-means algorithm. The proposed overlapped block method is piled up one on another per an half of the size of unit-block when an input image is split into several unit-blocks. Therefore, we define a data unit as the unit-block of the block size, $16{\times}16$ pixels. We reconstruct the processed data units into the original form of input image by using an isotropic form of Hanning Window. Finally, in order to evaluate the performance of the abovementioned algorithms, we compare three image, an input image with ringing artifact, an image result obtained by conventional method (non-overlapped), and an image result obtained the proposed method.

Automatic Generation of Fuzzy Rules using the Fuzzy-Neural Networks

  • Ahn, Taechon;Oh, Sungkwun;Woo, Kwangbang
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1181-1186
    • /
    • 1993
  • In the paper, a new design method of rule-based fuzzy modeling is proposed for model identification of nonlinear systems. The structure indentification is carried out, utilizing fuzzy c-means clustering. Fuzzy-neural networks composed back-propagation algorithm and linear fuzzy inference method, are used to identify parameters of the premise and consequence parts. To obtain optimal linguistic fuzzy implication rules, the learning rates and momentum coefficients are tuned automatically using a modified complex method.

  • PDF

Enhancement of Authentication Performance based on Multimodal Biometrics for Android Platform (안드로이드 환경의 다중생체인식 기술을 응용한 인증 성능 개선 연구)

  • Choi, Sungpil;Jeong, Kanghun;Moon, Hyeonjoon
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.3
    • /
    • pp.302-308
    • /
    • 2013
  • In this research, we have explored personal authentication system through multimodal biometrics for mobile computing environment. We have selected face and speaker recognition for the implementation of multimodal biometrics system. For face recognition part, we detect the face with Modified Census Transform (MCT). Detected face is pre-processed through eye detection module based on k-means algorithm. Then we recognize the face with Principal Component Analysis (PCA) algorithm. For speaker recognition part, we extract features using the end-point of voice and the Mel Frequency Cepstral Coefficient (MFCC). Then we verify the speaker through Dynamic Time Warping (DTW) algorithm. Our proposed multimodal biometrics system shows improved verification rate through combining two different biometrics described above. We implement our proposed system based on Android environment using Galaxy S hoppin. Proposed system presents reduced false acceptance ratio (FAR) of 1.8% which shows improvement from single biometrics system using the face and the voice (presents 4.6% and 6.7% respectively).

An Improved Clustering Method with Cluster Density Independence

  • Yoo, Byeong-Hyeon;Kim, Wan-Woo;Heo, Gyeongyong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.15-20
    • /
    • 2015
  • In this paper, we propose a modified fuzzy clustering algorithm which can overcome the center deviation due to the Euclidean distance commonly used in fuzzy clustering. Among fuzzy clustering methods, Fuzzy C-Means (FCM) is the most well-known clustering algorithm and has been widely applied to various problems successfully. In FCM, however, cluster centers tend leaning to high density clusters because the Euclidean distance measure forces high density cluster to make more contribution to clustering result. Proposed is an enhanced algorithm which modifies the objective function of FCM by adding a center-scattering term to make centers not to be close due to the cluster density. The proposed method converges more to real centers with small number of iterations compared to FCM. All the strengths can be verified with experimental results.

Performance Improvement on MFCM for Nonlinear Blind Channel Equalization Using Gaussian Weights (가우시안 가중치를 이용한 비선형 블라인드 채널등화를 위한 MFCM의 성능개선)

  • Han, Soo-Whan;Park, Sung-Dae;Woo, Young-Woon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.407-412
    • /
    • 2007
  • 본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.

  • PDF

Adaptive Clustering Algorithm for Recycling Cell Formation: An Application of Fuzzy ART Neural Networks

  • Seo, Kwang-Kyu;Park, Ji-Hyung
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.12
    • /
    • pp.2137-2147
    • /
    • 2004
  • The recycling cell formation problem means that disposal products are classified into recycling part families using group technology in their end-of-life phase. Disposal products have the uncertainties of product status by usage influences during product use phase, and recycling cells are formed design, process and usage attributes. In order to deal with the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem for disposal products. Fuzzy C-mean algorithm and a heuristic approach based on fuzzy ART neural network is suggested. Especially, the modified Fuzzy ART neural network is shown that it has a good clustering results and gives an extension for systematically generating alternative solutions in the recycling cell formation problem. Disposal refrigerators are shown as examples.

A DFT Based Filtering Technique to Eliminate Decaying dc and Harmonics for Power System Phasor Estimation

  • Oh Yong- Taek;Balamourougan V.;Sidhu T.S.
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.138-143
    • /
    • 2005
  • During faults, the voltage and current signals available to the relay are affected by the decaying dc component and harmonics. In order to make appropriate and accurate decisions, most of the relaying algorithms require the fundamental frequency phasor information that is immune to decaying dc effect and harmonics. The conventional Fourier ph as or estimation algorithm is affected by the presence of decaying-exponential transients in the fault signal. This paper presents a modified Fourier algorithm, which effectively eliminates the decaying dc component and the harmonics present in the fault signal. The decaying dc parameters are estimated by means of an out-of-band filtering technique. The decaying dc offset and harmonics are removed by means of a simple computational procedure that involves the design of two sets of Orthogonal digital OFT filters tuned at different frequencies and by creating three off-line look-up tables. The technique was tested for different decay rates of the decaying dc component. It was also compared with the conventional mimic plus the full cycle OFT algorithm. The results indicate that the proposed technique has a faster convergence to the desired value compared to the conventional mimic plus OFT algorithms over a wide range of decay rates. In all cases, the convergence to the desired value was achieved within one cycle of the power system frequency.

Coordinated Cognitive Tethering in Dense Wireless Areas

  • Tabrizi, Haleh;Farhadi, Golnaz;Cioffi, John Matthew;Aldabbagh, Ghadah
    • ETRI Journal
    • /
    • v.38 no.2
    • /
    • pp.314-325
    • /
    • 2016
  • This paper examines the resource gain that can be obtained from the creation of clusters of nodes in densely populated areas. A single node within each such cluster is designated as a "hotspot"; all other nodes then communicate with a destination node, such as a base station, through such hotspots. We propose a semi-distributed algorithm, referred to as coordinated cognitive tethering (CCT), which clusters all nodes and coordinates hotspots to tether over locally available white spaces. CCT performs the following these steps: (a) groups nodes based on a modified k-means clustering algorithm; (b) assigns white-space spectrum to each cluster based on a distributed graph-coloring approach to maximize spectrum reuse, and (c) allocates physical-layer resources to individual users based on local channel information. Unlike small cells (for example, femtocells and WiFi), this approach does not require any additions to existing infrastructure. In addition to providing parallel service to more users than conventional direct communication in cellular networks, simulation results show that CCT can increase the average battery life of devices by 30%, on average.