• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.75-77
• /
• 1999

정보추천 시스템은 사용자가 어떤 정보를 선호하는지를 식별함으로써 산재한 정보 중에서 적절한 정보만을 제공하는 것을 목표로 한다. 이러한 정보추천 시스템에서 사용되는 정보여과 기술에는 내용기반 여과와 협력적 여과가 있다. 기존의 협력적 정보여과 기술은 선호도를 적게 제시한 사용자에게 정보를 추천하기 어렵고, 동일한 상품 정보에 대해서 사용자의 평가가 없을 경우 사용자간의 유사성을 판단하기 어려운 단점이 있다. 본 논문은 SVD (Singular Value Decomposition)를 통해 사용자 프로파일을 정량화함으로써 사용자 선호도 행렬로부터 숨어있는 의미정보를 추출하여 동일한 정보에 대해 선호도를 평가해야 한다는 단점을 극복한다. 이때, 사용자 프로파일 벡터를 비감독 학습 알고리즘인 SOM (Self0Organizing Map)으로 클러스터링하여 사용자를 분류하고, 정보추천은 사용자 그룹간에서 이루어지며 Pearson correlation 알고리즘을 이용한다. 기존의 방법과 비교한 결과, 제안한 방법이 새로운 사용자에 대해서도 적절한 정보를 추천할 수 있음을 볼 수 있었다.

• MALSORI
• /
• no.64
• /
• pp.1-14
• /
• 2007

The purpose of this study was to examine the acoustic perception different by formants change for profoundly hearing impaired children with cochlear implants. The subjects were 10 children after 15 months of experience with the implant and mean of their chronological age was 8.4 years and Standard deviation was 2.9 years. The ability of auditory perception was assessed using acoustic-synthetic vowels. The acoustic-synthetic vowel was combined with F1, F2, and F3 into a vowel and produced 42 synthetic sound, using Speech GUI(Graphic User Interface) program. The data was deal with clustering analysis and on-line analytical processing for perception ability of acoustic synthetic vowel. The results showed that auditory perception scores of acoustic-synthetic vowels for cochlear implanted children were increased in F2 synthetic vowels compaire to those of F1. And it was found that they perceived the differences of vowels in terms of distance rates between F1 and F2 in specific vowel.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.27-33
• /
• 2006

In this thesis, we presents the component design and retrieval prototype system which can retrieve the most appropriate component for reuse system. If it used only an abject to reuse unit, it can not understand mutual reaction and can not sustain relationship between objects. Therefore, we porposed clustering component for reuse unit. It makes to understand relationship and reaction between object, so User can retrieve the proper component for reuse system. And porposed retrieval prototype system can select the correct things. it provide 3 facet retrieval environment against ambiguous retrieval definition.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.2
• /
• pp.110-115
• /
• 2006

In pure P2P environment, it is possible to provide service by using a little real-time information without using accumulated information. But in case of using only a little information that was locally collected, quality of recommendation service can be fallen-off. Therefore, it is necessary to study a method to improve qualify of recommendation service by using users' context information. But because a great volume of users' context information can be recognized in a moment, there can be a scalability problem and there are limitations in supporting differentiated services according to fields and items. In this paper, we solved the scalability problem by clustering context information per each service field and classifying it per each user, using SOM. In addition, we could recommend proper services for users by quantifying the context information of the users belonging to the similar classification to the service requester among classified data and then using collaborative filtering.

• The KIPS Transactions:PartB
• /
• v.8B no.2
• /
• pp.144-154
• /
• 2001

협력적 여과 시스템은 사용자가 검색하고 읽었던 웹문서를 기반으로 사용자 군집을 생성하여 웹문서의 정확한 추천을 가능하게 한다. 이러한 목적으로 설계된 다양한 알고리즘이 있으나 속도가 느리거나 정확도가 낮다는 등의 단점이 있다. 본 논문에서는 이러한 단점을 보완하기 위하여 협력적 여과 시스템을 위한 효과적인 사용자 군집 알고리즘인 CUG알고리즘은 사용자 군집을 생성하기 위해 Apriori 알고리즘, Native Bayes 알고리즘을 이용한다. Apriori 알고리즘은 연관 단어 지식 베이스를 구축하고, Native Bayes 알고리즘은 구축된 연관 단어 지식 베이스에 가중치를 추가하며, 사용자가 검색하여 읽은 웹문서를 클래스별로 분류한다. CUG 알고리즘은 분류된 웹문서를 기반으로 하여 사용자 군집을 만든다. 이러한 방법으로 설계된 CUG 알고리즘은 사용자들이 사용할 문서를 미리 검색하여 저장함에 의해 정보검색의 효율성을 향상시키는데 사용될 수 있다. 본 논문에서 설계한 CUG 알고리즘의 선능을 평가하기 위하여 기존의 K-means 방법과 Gibbs샘플링 방법에 의한 군집과 비교한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1085-1091
• /
• 2006

The major goal of this paper is to develop a practically implemental radial basis function (RBF) neural network based multi-user detector (MUD) for direct sequence (DS)-CDMA system. This work is expected to provide an efficient solution for RBF based MUD by quickly setting up the proper number of RBF centers and their locations required in training. The basic idea in this research is to estimate all the possible RBF centers by using supervised ${\kappa-means$ clustering technique, and select the only centers which locate near seemingly decision boundary between centers, and reduce further by grouping the some of centers adjacent each other. Therefore, it reduces the computational burden for finding the proper number of RBF centers and their locations in the existing RBF based MUD, and ultimately, make its implementation practical.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.105-107
• /
• 1998

본 연구는 웹 에이전트에 있어서 가장 핵심적인 부분이라 할 수 있는 사용자 특성모델 구축방법을 개선하는데 목적을 두고 있다. 사용자 특성모델을 귀납적 기계학습 방식으로 자동 추출하기 위해서는, 사용자가 관심을 가지는 분야별로 문서를 자동 분류하는 작업이 매우 중요하다. 지금까지의 방식은 사람이 관심부여에 따라 문서를 수동적으로 분류해 왔으나, 문서의 양이 기하급수적으로 증가할 경우 처리할 수 있는 문서의 양에는 한계가 있을 수밖에 없다. 또한 수작업 문서 분류 방식을 웹 에이전트에 그대로 적용하였을 경우 사용자가 일일이 문서를 분류해야한다는 번거로움으로 인해 웹 에이전트의 효용성이 반감될 것이다. 따라서 본 연구에서는 비감독 문서 분류 알고리즘과 그것을 바탕으로 얻어진 문서 분류 정보를 후처리 (Post-Processing)함으로써 보다 간결하고 정확한 문서 분류 결과를 얻을 수 있는 구체적인 방법을 제공하고자 한다.

• Management Science and Financial Engineering
• /
• v.11 no.3
• /
• pp.137-153
• /
• 2005

Collaborative filtering-based recommendation systems make personalized recommendations based on users' ratings on products. Recommender systems must collect sufficient rating information from users to provide relevant recommendations because less user rating information results in poorer performance of recommender systems. To learn about new users, recommendation systems must first present users with an initial item list. In this study, we designed and analyzed seven selection strategies including the popularity, favorite, clustering, genre, and entropy methods. We investigated how these strategies performed using MovieLens, a public dataset. While the favorite and popularity methods tended to produce the highest average score and greatest average number of ratings, respectively, a hybrid of both favorite and popularity methods or a hybrid of demographic, favorite, and popularity methods also performed within acceptable ranges for both rating scores and numbers of ratings.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.628-635
• /
• 1990

This paper describes a new gate array layout system, HAN-LACAD-G(HANyang LAyout CAD system for Gate array). HAN-LACAD-G is composed of placer, global router, detailed router, and output processor. In placement design, initial placement is performed by repetitive clustering and min-cut partitioning followed by placement improvement using the concept of pairwise interchange. In global routing phase, pins are assigned in each channel considering the routing congestion estimation and overflows in feedthroughs are restricted. For the detailed routing, we use layer and three layer channel routing techniques. Layout results are displayed graphically and modified interactively by the user using the layout editor.

• Journal of the Semiconductor & Display Technology
• /
• v.3 no.4
• /
• pp.13-17
• /
• 2004

As the usage of wireless LAN becomes common in working environment, the number of database systems that support both wired and wireless users increases rapidly. The characteristics of wireless LAN that its speed is slow relatively comparing to wired network and the users in its environment connects to different communication points as they moves creates another challenge to be resolved in database systems. In the environment of hybrid communication systems, wired and wireless for voluminous data amount and a number of users, the two layer architecture of the conventional client-server database systems has limitation in the system performance. This is due to that server is the only point of data service in client-server database systems. In this paper, we discuss a new extended database system architecture that data services are distributed among servers and clients based on user database access patterns in order to improve system performance. We analyze the expected system performance by using simulation technique and prove the practical utilization of the system by demonstrating experimental results.