With the extension of the World Wide Web, more than 7 million new pages being exploited each day, the problem of information overload due to a large number of coping, spreading and sharing causes the decreasing information quantity, diverse format of information and low quality of information. More researchers research what methods including search and recommendation can help users gather the critical topics. Whatever methods use historical purchasing or browsing data to find the proper information usually, can not considering all attributes affecting decision results. Therefore, the research uses Analytic Hierarchy Process belonging Multiple Critical Decision Theory to develop recommendation system.
Providing a single, easy understand model, using hierarchic structuring reflecting the nature tendency of the mind, considering all attributes affecting decision results, Analytic Hierarchy Process takes into consideration the relative priorities and select the best alternative. Furthermore, it can show the subjective consciousness of the user in a structure way and assist designer to determine a more rational and conformable judgment. Based on Analytic Hierarchy Process, the commerce recommendation system expects to help user to find more satisfactory merchandise. It is found that the recommendation system using Analytic Hierarchy Process finds the accurate products for user and gets the higher satisfaction. However, the operation satisfaction is not higher that rank-based but still in available and satisfaction scope.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0726104-175130 |
Date | 26 July 2004 |
Creators | Kuo, Ya-Ru |
Contributors | I.L. Wu, Ting-Peng Liang, Chih-Ping Wei |
Publisher | NSYSU |
Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
Language | Cholon |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726104-175130 |
Rights | withheld, Copyright information available at source archive |
Page generated in 0.0019 seconds