• Title/Summary/Keyword: Fuzzy Searching

Search Result 85, Processing Time 0.024 seconds

Bi-directional Fuzzy Matching Algorithm (양방향 퍼지 매칭 알고리즘: 취업정보 적용)

  • Kim, Hyoung-Rae;Jeong, In-Soo
    • Journal of Internet Computing and Services
    • /
    • v.12 no.3
    • /
    • pp.69-76
    • /
    • 2011
  • Matching customers becomes the key function in on-line mediate services. There are two matching methods: one-directional matching that requires requests from one side(e,g., information searching), bi-directional matching that considers requests from both sides. Previous bi-directional matching has difficulties of getting the interests explicitly and service collapse problems when the opposite side do not put responding interests. This paper attempts to automate the inputs of interests for bi-directional matching by calculating the interests with fuzzy matching algorithm for optimization. The results of the proposed Bi-directional Fuzzy Matching(BDFM) algorithm told that the job placement accuracy of employment information matching results is over 95%. And, BDFM gives statically significant positive effect for motivating the employment activities when analyzed the effect after completing the implementation.

Design and Implementation of Web Directory Engine Using Dynamic Category Hierarchy (동적분류에 의한 주제별 웹 검색엔진의 설계 및 구현)

  • Choi Bum-Ghi;Park Sun;Park Tae-Su;Song Jae-Won;Lee Ju-Hong
    • Journal of Internet Computing and Services
    • /
    • v.7 no.2
    • /
    • pp.71-80
    • /
    • 2006
  • In web search engines, there are two main methods: directory searching and keyword searching. Keyword searching shows high recall rate but tends to come up with too many search results to find which users want to see the pages. Directory searching has also a difficulty to find the pages that users want in case of selecting improper category without knowing the exact category, that is, it shows high precision rates but low recall rates. We designed and implemented a new web search engine to resolve the problems of directory search method. It regards a category as a fuzzy set which contains keywords and calculate the degree of inclusion between categories. The merit of this method is to enhance the recall rate of directory searching by expanding subcategories on the basis of similarity.

  • PDF

An Experimental Study on Ranking Output of Title Word Searching in the Boolean OPAC System (OPAC에서 서명단어탐색의 문헌순위화에 관한 연구)

  • 노정순
    • Journal of the Korean Society for information Management
    • /
    • v.18 no.2
    • /
    • pp.7-30
    • /
    • 2001
  • The characteristics of the short document representatives and short queries of OPAC systems need the different ranking algorithms from IR systems. This study tested and analyzed the effectiveness of four sorting schemes and four ranking algorithms and the six effectiveness measurements for the ranked Boolean OPAC systems. The sorting by publication year was better but without significant difference. The cover density ranking was significantly better than the frequency-based ranking of the Fuzzy or DNF models. The simple effectiveness measurement based on the average rank of relevant documents retrieved was as good as the others and better than the precision P.

  • PDF

Database using Personal Information Management System

  • Kim, Jae-Woo;Kim, Don-Go;Kang, Sang-Gil;Kim, Dong-Hyun;Kim, Won-Il
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.4
    • /
    • pp.260-263
    • /
    • 2008
  • In this paper we propose Personal Information Management System for Library Database. It manages personal search pattern for the given user and provide specific book list for library book search system. With the proposed system, the conventional overlap searching time will be decreased with personalized information and search history. This system manages the individual data according to personal searching pattern, sequence and usability. Therefore, the user can locate necessary book information more accurately with their distinct interest and search history.

Study on the Collision Avoidance Algorithm against Multiple Traffic Ships using Changeable Action Space Searching Method (가변공간 탐색법을 이용한 다중선박의 충돌회피 알고리즘에 관한 연구)

  • Son, N.S.;Furukawa, Y.;Kim, S.Y.;Kijima, K.
    • Journal of the Korean Society for Marine Environment & Energy
    • /
    • v.12 no.1
    • /
    • pp.15-22
    • /
    • 2009
  • Auto-navigation algorithm have been studied to avoid collision and grounding of a ship due to human error. There have been many research on collision avoidance algorithms but they have been validated little on the real coastal traffic situation. In this study, a Collision Avoidance algorithm is developed by using Fuzzy algorithm and the concept of Changeable Action Space Searching (CAS). In the first step, on a basis of collision risk calculated from fuzzy algorithm in the current time(t=to), alternative Action Space for collision avoidance is planned. In the second step, next alternative Action Space for collision avoidance in the future($t=to+{\Delta}t$) is corrected and re-planned with re-evaluated collision risk. In the third step, the safest and most effective course among Action Space is selected by using optimization method in real time. In this paper, the main features of the developed collision avoidance algorithm (CAS) are introduced. CAS is implemented in the ship-handling simulator of MOERI. The performance of CAS is tested on the situation of open sea with 3 traffic ships, whose position is assumed to be informed from AIS. Own-ship is fully autonomously navigated by autopilot including the collision avoidance algorithm, CAS. Experimental results show that own-ship can successfully avoid the collision against traffic ships and the calculated courses from CAS are reasonable.

  • PDF

Development of Fuzzy Logic Ant Colony Optimization Algorithm for Multivariate Traveling Salesman Problem (다변수 순회 판매원 문제를 위한 퍼지 로직 개미집단 최적화 알고리즘)

  • Byeong-Gil Lee;Kyubeom Jeon;Jonghwan Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.1
    • /
    • pp.15-22
    • /
    • 2023
  • An Ant Colony Optimization Algorithm(ACO) is one of the frequently used algorithms to solve the Traveling Salesman Problem(TSP). Since the ACO searches for the optimal value by updating the pheromone, it is difficult to consider the distance between the nodes and other variables other than the amount of the pheromone. In this study, fuzzy logic is added to ACO, which can help in making decision with multiple variables. The improved algorithm improves computation complexity and increases computation time when other variables besides distance and pheromone are added. Therefore, using the algorithm improved by the fuzzy logic, it is possible to solve TSP with many variables accurately and quickly. Existing ACO have been applied only to pheromone as a criterion for decision making, and other variables are excluded. However, when applying the fuzzy logic, it is possible to apply the algorithm to various situations because it is easy to judge which way is safe and fast by not only searching for the road but also adding other variables such as accident risk and road congestion. Adding a variable to an existing algorithm, it takes a long time to calculate each corresponding variable. However, when the improved algorithm is used, the result of calculating the fuzzy logic reduces the computation time to obtain the optimum value.

An accurate sun tracking controller with reconstructing facility for fault sensor (오류신호보정기능을 갖춘 정밀 태양추적제어기)

  • Keun, Hyun-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1913-1920
    • /
    • 2009
  • An intelligent accurate sun tracking controller for solar lighting system was developed. This controller can detect the faulty sensor and correct the error signal based on Principle Component Analysis theory. A fuzzy controller was developed to control the tracker by using the collected sensor signal for precise position control. Also a multiple range searching sensor module for sun tracking was designed. To show the validity of the developed system, some experiments in the field were illustrated.

A Study on Optimal Path Searching using Fuzzy and GAs (퍼지와 유전 알고리즘을 이용한 최적경로 탐색 연구)

  • An, Dae-Hun;Choe, U-Gyeong;Seo, Jae-Yong;Kim, Seong-Hyeon;Jeon, Hong-Tae
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.161-164
    • /
    • 2007
  • 우리는 알지 못하는 장소를 찾기 위해 네비게이션을 이용한다. 아직은 단순히 최단거리를 알려주는 네비게이션이 주를 이루고 있다. 하지만 그 길이 최적의 경로가 되는 것은 아니다. 이 논문에서는 이러한 점을 보완하기 위한 새로운 방법을 제시하고 있다. RFID 리더기와 카드를 이용하여 이용자의 출입을 체크함으로써 실시간으로 변하는 각 장소의 인원현황을 알 수 있다. 그리고 거리, 혼잡도, 선호도 등의 몇 가지 정보들을 토대로 퍼지와 유전자 알고리즘을 기반으로 하는 TSP를 이용하여 각각의 이용자 성향에 맞는 최적의 경로를 알 수 있다. 접근성을 높이기 위해 최적의 경로를 보여주는 디스플레이를 장착한 로봇을 이용한다. 다양한 컨텐츠를 포함시키면 더욱 발전한 안내 시스템으로서의 구현이 가능하다.

  • PDF

Obstacle Avoidance and Planning using Optimization of Cost Fuction based Distributed Control Command (분산제어명령 기반의 비용함수 최소화를 이용한 장애물회피와 주행기법)

  • Bae, Dongseog;Jin, Taeseok
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.21 no.3
    • /
    • pp.125-131
    • /
    • 2018
  • In this paper, we propose a homogeneous multisensor-based navigation algorithm for a mobile robot, which is intelligently searching the goal location in unknown dynamic environments with moving obstacles using multi-ultrasonic sensor. Instead of using "sensor fusion" method which generates the trajectory of a robot based upon the environment model and sensory data, "command fusion" method by fuzzy inference is used to govern the robot motions. The major factors for robot navigation are represented as a cost function. Using the data of the robot states and the environment, the weight value of each factor using fuzzy inference is determined for an optimal trajectory in dynamic environments. For the evaluation of the proposed algorithm, we performed simulations in PC as well as real experiments with mobile robot, AmigoBot. The results show that the proposed algorithm is apt to identify obstacles in unknown environments to guide the robot to the goal location safely.

On ths Stability Issues of Linear Takagi-Sugeno Fuzzy Models

  • Joh, Joongseon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.7 no.2
    • /
    • pp.110-121
    • /
    • 1997
  • Stability issues of linear Takagi-Sugeno fuzzy modles are thoroughly investigated. At first, a systematic way of searching for a common symmetric positive definite P matrix (common P matrix in short), which is related to stability, is proposed for N subsystems which are under a pairwise commutativity assumption. Robustness issue under modeling uncertainty in each subsystem is then considered by proposing a quadratic stability criterion and a method of determining uncertainty bounds. Finally, it is shown that the pairwise commutative assumption can be in fact relaxed by interpreting the uncertainties as mismatch parts of non-commutative system matrices. Several examples show the validity of the proposed methods.

  • PDF