计算机应用胡丹编辑,Mining Ceteris Paribus preference from preference database

摘要：

Focusing on the issue that the traditional recommendation system requires users to give a clear preference matrix( U-I matrix) and then uses automation technology to capture the user preferences, a method for mining preference information of Agent from preference database was introduced. From the perspective of knowledge discovery, a k order preference mining algorithm named k Pre M was proposed according to the Ceteris Paribus rules( CP rules). The k order CP rules were used to prune the information in the preference database, which decreased the database scanning times and increased the efficiency of mining preference. Then a general graph model named CP-nets( Conditional Preference networks)was used as a tool to reveal that the user preferences can be approximated by the corresponding CP-nets. The theoretical analysis and simulation results show that the user preferences are conditional preferences. In addition, the xcavation of CP-nets preference model provides a theoretical basis for designing personalized recommendation system.

展开