• Title/Summary/Keyword: 적응형 k-NN

Search Result 6, Processing Time 0.017 seconds

Humor Document Recommendation using Adaptive K-NN with PCA (PCA 및 적응형 k-NN을 이용한 유머문서의 추천)

  • 이종우;장병탁
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.133-136
    • /
    • 2000
  • 우리는 인터넷을 통한 사용자의 선호도(preference)를 분석하고 협력적 여과 기술을 학습하여 유머문서를 추천하는 MrHumor 시스템을 구축하였다. MrHumor에서는 사용자집합이 유머문서 집합에 대하여 보여준 등급매김값을 토대로 사용집합의 백터공간(vector space)를 설정하고 노이즈에 강하면서 효율적인 학습을 위해 선형 PCA를 이용하여 축소된 2차원 공간상에서 유머문서의 통계적 특성을 반영하여 적응형 k-NN으로 지엽성을 적적히 조절하여 새로운 문서에 대한 선호도를 추정하게 된다.

  • PDF

A study on the imputation solution for missing speed data on UTIS by using adaptive k-NN algorithm (적응형 k-NN 기법을 이용한 UTIS 속도정보 결측값 보정처리에 관한 연구)

  • Kim, Eun-Jeong;Bae, Gwang-Soo;Ahn, Gye-Hyeong;Ki, Yong-Kul;Ahn, Yong-Ju
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.3
    • /
    • pp.66-77
    • /
    • 2014
  • UTIS(Urban Traffic Information System) directly collects link travel time in urban area by using probe vehicles. Therefore it can estimate more accurate link travel speed compared to other traffic detection systems. However, UTIS includes some missing data caused by the lack of probe vehicles and RSEs on road network, system failures, and other factors. In this study, we suggest a new model, based on k-NN algorithm, for imputing missing data to provide more accurate travel time information. New imputation model is an adaptive k-NN which can flexibly adjust the number of nearest neighbors(NN) depending on the distribution of candidate objects. The evaluation result indicates that the new model successfully imputed missing speed data and significantly reduced the imputation error as compared with other models(ARIMA and etc). We have a plan to use the new imputation model improving traffic information service by applying UTIS Central Traffic Information Center.

A Learning Model for Recommendation of Humor Documents (유머문서 추천을 위한 기계학습 기법)

  • 이종우;장병탁
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.253-255
    • /
    • 2001
  • 인터넷을 통한 사용자의 선호도를 분석하고 협력적 여과 및 내용기반 여과 기술을 결합 이용하여 유머문서를 추천하는 MrHumor 시스템을 구축하였다. 유머문서 추천 기술은 다양한 아이템에 대한 여과 및 추천 기술로 확장되어 인터넷을 통한 과다 정보 시대에 필요한 소프트봇 혹은 지능형 에이전트 기술에 적용될 수 있다. MrHumor 추천시스템은 적응형 학습 시스템으로서 새로운 사용자의 선호도에 대한 학습량과 추천시기에 따라 이용할 추천방식이 다른 성능을 보이는데 여러 가지 상황에서도 적절한 동작을 보이기 위하여 MrHumor에서는 은닉변수 모델을 이용하여 사용자의 인구통계적 정보와 문서의 내용적 특징간의 관계를 학습하여 초기 추천을 행하고 SVM을 이용하여 개인의 선호도를 학습한 내용 기반의 여과와 적응형 k-NN모델을 이용한 협력적 여과를 결합하여 추천을 수행한다. 제안된 방식에 의한 추천 성능은 3방식이 각각 이용된 경우에 비해 안정적이고 높은 예측 정확도를 보인다.

  • PDF

NN-based Adaptive Control for a Skid-type Autonomous Unmanned Ground Vehicle (스키드형 무인자율차량을 위한 신경망 기반 적응제어 기법 설계)

  • Shin, Jongho;Joo, Sanghyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.12
    • /
    • pp.1278-1283
    • /
    • 2014
  • This study proposes a NN (Neural Networks)-based adaptive control method for a 6X6 skid-type UGV (Unmanned Ground Vehicle) with 6 in-wheel motors. The UGV experiences lots of uncertainties and, thus, the control performance can degrade significantly without a compensation of the unknown terms. To improve the control performance of the UGV, the NN is utilized to design the adaptive controller. Then, the designed overall force and moment are optimally distributed into 6 traction forces with the assumption that six vertical forces of the UGV are known exactly, because the six traction forces are original source to be excited to the UGV to move. Finally, numerical simulations with the TruckSim model are performed to validate the effectiveness of the proposed approach.

A Memory-based Reasoning Algorithm using Adaptive Recursive Partition Averaging Method (적응형 재귀 분할 평균법을 이용한 메모리기반 추론 알고리즘)

  • 이형일;최학윤
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.478-487
    • /
    • 2004
  • We had proposed the RPA(Recursive Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. That algorithm worked not bad in many area, however, the major drawbacks of RPA are it's partitioning condition and the way of extracting major patterns. We propose an adaptive RPA algorithm which uses the FPD(feature-based population densimeter) to stop the ARPA partitioning process and produce, instead of RPA's averaged major pattern, optimizing resulting hyperrectangles. The proposed algorithm required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the RPA. Also, by reducing the number of stored patterns, it showed an excellent results in terms of classification when we compare it to the k-NN.

Adaptive Scene Classification based on Semantic Concepts and Edge Detection (시멘틱개념과 에지탐지 기반의 적응형 이미지 분류기법)

  • Jamil, Nuraini;Ahmed, Shohel;Kim, Kang-Seok;Kang, Sang-Jil
    • Journal of Intelligence and Information Systems
    • /
    • v.15 no.2
    • /
    • pp.1-13
    • /
    • 2009
  • Scene classification and concept-based procedures have been the great interest for image categorization applications for large database. Knowing the category to which scene belongs, we can filter out uninterested images when we try to search a specific scene category such as beach, mountain, forest and field from database. In this paper, we propose an adaptive segmentation method for real-world natural scene classification based on a semantic modeling. Semantic modeling stands for the classification of sub-regions into semantic concepts such as grass, water and sky. Our adaptive segmentation method utilizes the edge detection to split an image into sub-regions. Frequency of occurrences of these semantic concepts represents the information of the image and classifies it to the scene categories. K-Nearest Neighbor (k-NN) algorithm is also applied as a classifier. The empirical results demonstrate that the proposed adaptive segmentation method outperforms the Vogel and Schiele's method in terms of accuracy.

  • PDF