• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/

Bi-directional Fuzzy Matching Algorithm


Hyoung-Rae Kim, In-Soo Jeong, Journal of Internet Computing and Services, Vol. 12, No. 3, pp. 69-76, Jun. 2011
Full Text:
Keywords: Matching optimization, Bi-directional fuzzy matching algorithm, Employment information matching

Abstract

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[APA Style]
Kim, H. & Jeong, I. (2011). Bi-directional Fuzzy Matching Algorithm. Journal of Internet Computing and Services, 12(3), 69-76.

[IEEE Style]
H. Kim and I. Jeong, "Bi-directional Fuzzy Matching Algorithm," Journal of Internet Computing and Services, vol. 12, no. 3, pp. 69-76, 2011.

[ACM Style]
Hyoung-Rae Kim and In-Soo Jeong. 2011. Bi-directional Fuzzy Matching Algorithm. Journal of Internet Computing and Services, 12, 3, (2011), 69-76.