本文選題：推薦系統(tǒng) + 聚類(lèi)��； 參考：《河北大學(xué)》2017年碩士論文

【摘要】：進(jìn)入21世紀(jì)以來(lái),在互聯(lián)網(wǎng)和電子商務(wù)網(wǎng)站飛速發(fā)展的背景下,電子商務(wù)網(wǎng)站中的信息量變得更為龐大和復(fù)雜,繁冗的數(shù)據(jù)給電子商務(wù)的發(fā)展帶來(lái)巨大的挑戰(zhàn)。為了解決這一難題,針對(duì)電子商務(wù)的推薦系統(tǒng)應(yīng)運(yùn)而生,電子商務(wù)推薦系統(tǒng)主要目的是幫助用戶(hù)迅速的定位到自己喜歡的商品。在目前主流的各種推薦算法中,協(xié)同過(guò)濾算法是一種應(yīng)用較廣的推薦算法,但傳統(tǒng)的協(xié)同過(guò)濾存在“稀疏性”、“冷啟動(dòng)”和“可擴(kuò)展性”等問(wèn)題。近年來(lái)關(guān)于推薦系統(tǒng)的研究中,一些學(xué)者提出將聚類(lèi)技術(shù)引入到推薦系統(tǒng)中用以解決上述問(wèn)題�；诰垲�(lèi)的推薦算法通過(guò)先對(duì)用戶(hù)或者項(xiàng)目進(jìn)行聚類(lèi)劃分,使得相似度較高的對(duì)象聚集到同一個(gè)類(lèi)中,從而簡(jiǎn)化查找最近鄰居的過(guò)程,大大減小了整體計(jì)算復(fù)雜度和時(shí)間消耗。另外由于聚類(lèi)過(guò)程可以在線下完成,所以大大提升了推薦系統(tǒng)整體的實(shí)時(shí)性。本文提出了基于AP聚類(lèi)的推薦算法,主要研究?jī)?nèi)容如下:(1)提出并設(shè)計(jì)了基于AP聚類(lèi)的推薦算法。將AP聚類(lèi)算法引入到推薦系統(tǒng)的用戶(hù)分類(lèi)過(guò)程中,僅需要將目標(biāo)用戶(hù)通過(guò)AP聚類(lèi)方法進(jìn)行分類(lèi),簡(jiǎn)化查找最近鄰居和計(jì)算對(duì)象相似度的過(guò)程,降低了在整體計(jì)算中的復(fù)雜度和時(shí)間消耗。(2)傳統(tǒng)的AP聚類(lèi)不包括類(lèi)別的合并過(guò)程,使得聚類(lèi)的精度較差,尤其是對(duì)結(jié)構(gòu)復(fù)雜的數(shù)據(jù)。本文提出了一種基于屬性加權(quán)的度量方法,基于此對(duì)AP聚類(lèi)算法進(jìn)行了改進(jìn)。(3)設(shè)計(jì)并實(shí)現(xiàn)了基于改進(jìn)AP聚類(lèi)的推薦算法。在公共數(shù)據(jù)集上進(jìn)行了仿真實(shí)驗(yàn),評(píng)價(jià)指標(biāo)為平均絕對(duì)偏差(MAE)值,芮氏指標(biāo)(RI)和純度指標(biāo)(Purity),實(shí)驗(yàn)結(jié)果表明了本文算法的有效性。
[Abstract]:Since the beginning of the 21st century, with the rapid development of the Internet and e-commerce websites, the amount of information in e-commerce websites has become larger and more complex, and the redundant data has brought great challenges to the development of e-commerce. In order to solve this problem, E-commerce recommendation system emerges as the times require. The main purpose of E-commerce recommendation system is to help users locate their favorite products quickly. Collaborative filtering is one of the most popular recommendation algorithms, but there are some problems in the traditional collaborative filtering, such as "sparsity", "cold start" and "expansibility". In recent years, in the research of recommendation system, some scholars have proposed to introduce clustering technology to the recommendation system to solve the above problems. The recommendation algorithm based on clustering makes objects with high similarity gather into the same class by clustering users or items, thus simplifying the process of finding nearest neighbors and greatly reducing the overall computational complexity and time consumption. In addition, the clustering process can be completed off-line, so it greatly improves the real-time performance of the recommendation system as a whole. This paper proposes a recommendation algorithm based on AP clustering. The main research contents are as follows: 1) A recommendation algorithm based on AP clustering is proposed and designed. The AP clustering algorithm is introduced into the user classification process of recommendation system. It is only necessary to classify the target users by AP clustering method to simplify the process of finding nearest neighbor and computing object similarity. It reduces the complexity and time consumption in the whole computation.) the traditional AP clustering does not include the merging process of the categories, which makes the accuracy of the clustering worse, especially for the data with complex structure. In this paper, an attribute weighted measurement method is proposed. Based on this, an improved AP clustering algorithm is designed and a recommendation algorithm based on improved AP clustering is implemented. Simulation experiments are carried out on common data sets. The evaluation indexes are mean absolute deviation (mae), Rui's index and purity index. The experimental results show the effectiveness of the proposed algorithm.
【學(xué)位授予單位】：河北大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP391.3

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 楊武;唐瑞;盧玲;;基于內(nèi)容的推薦與協(xié)同過(guò)濾融合的新聞推薦方法[J];計(jì)算機(jī)應(yīng)用;2016年02期

2 高全力;高嶺;楊建鋒;王海;;上下文感知推薦系統(tǒng)中基于用戶(hù)認(rèn)知行為的偏好獲取方法[J];計(jì)算機(jī)學(xué)報(bào);2015年09期

3 向培素;;一種自適應(yīng)AP算法的matlab實(shí)現(xiàn)[J];西南民族大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年06期

4 寧麗娜;趙龍;陶洪波;趙成林;;基于AP聚類(lèi)的數(shù)字信號(hào)調(diào)制體制識(shí)別方法[J];無(wú)線電工程;2013年12期

5 李慧;馬小平;胡云;施s，

本文編號(hào)：1922609