Return to search

區間最小距離及其應用於網站男女最速配模式 / Minimum Distance with Interval Values and Its Applications on Internet Pals Making

目前網路上為了解決單身男女尋找配偶的問題,設計出一些網路交友平台。藉由速配機制,從茫茫人海中找出適合的另一半。本篇論文想要探討這些機制是否能夠達到最佳速配,使男女雙方找到適合自己的另一半。我們藉由模糊語意與軟計算技術,考慮以區間模糊數來計算兩者最小距離,以期達到最佳的男女速配。最後,我們改良Yahoo奇摩交友平台,並藉由實際資料來做模擬配對。由實證資料顯示,本研究方法,能將男女的速配度以更精確的數字呈現出來。 / So far, for the purpose of solving the problems of unmarried men and women who want to seek for spouses, people have designed some platforms for helping people make friends on internet. And from the “match system”, one can discover the suitable couple from the boundless huge crowd. But can these mechanisms attain the goal to reach the perfect match and find the another half? This paper use the fuzzy meaning and the soft computation technology to compute the minimum distance between two sets by trapezoid fuzzy number to make the suitability between men and women achieve the maximum.In the research designing part of the paper, we improve the Yahoo personals website in Taiwan, and we have the pals making by real data. From the research, we will find out that this way will help people choosing the pals who are close to everyone’s ideal spouse.

Identiferoai:union.ndltd.org:CHENGCHI/G0096751015
Creators陳彥豪, Chen, Yen Hao
Publisher國立政治大學
Source SetsNational Chengchi University Libraries
Language中文
Detected LanguageEnglish
Typetext
RightsCopyright © nccu library on behalf of the copyright holders

Page generated in 0.0018 seconds