Abstract
A matchmaking system is a type of recommender systems that provides a set of dating partners suitable for the user by online. Many matchmaking systems, which are widely used these days, require users to specify their preferences with regards to ideal dating partners based on criteria such as age, job and salary. However, some users are not aware of their exact preferences, or are reluctant to reveal this information even if they do know. Also, users’ selection standards are not fixed and can change according to circumstances. This paper suggests a new matchmaking system called Decision Tree based Matchmaking System (DTMS) that automatically adjusts the stated standards of a user by analyzing the characteristics of the people the user chose to contact. AMMS provides recommendations for new users on the basis of their explicit preferences. However, as a user’s behavioral records are accumulated, it begins to analyze their hidden implicit preferences using a decision tree technique. Subsequently, DTMS reflects these implicit preferences in proportion to their predictive accuracy. The DTMS is regularly updated when a user’s data size increases by a set amount. This paper suggests an architecture for the DTMS and presents the results of the implementation of a prototype.
| Translated title of the contribution | A Matchmaking System Adjusting the Mate-Selection Criteria based on a User’s Behaviors using the Decision Tree |
|---|---|
| Original language | Korean |
| Pages (from-to) | 115-129 |
| Number of pages | 15 |
| Journal | Information Systems Review |
| Volume | 14 |
| Issue number | 3 |
| State | Published - Dec 2012 |