TWI660315B - Sequence recommendation method - Google Patents

Sequence recommendation method Download PDF

Info

Publication number
TWI660315B
TWI660315B TW105135823A TW105135823A TWI660315B TW I660315 B TWI660315 B TW I660315B TW 105135823 A TW105135823 A TW 105135823A TW 105135823 A TW105135823 A TW 105135823A TW I660315 B TWI660315 B TW I660315B
Authority
TW
Taiwan
Prior art keywords
sequence
item
records
recommendation
matrix
Prior art date
Application number
TW105135823A
Other languages
Chinese (zh)
Other versions
TW201818319A (en
Inventor
張國韋
陸婉珍
林守德
楊鈞百
Original Assignee
中華電信股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中華電信股份有限公司 filed Critical 中華電信股份有限公司
Priority to TW105135823A priority Critical patent/TWI660315B/en
Publication of TW201818319A publication Critical patent/TW201818319A/en
Application granted granted Critical
Publication of TWI660315B publication Critical patent/TWI660315B/en

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本發明係揭露一種序列推薦之方法及其電腦程式產品,本發明所提方法包含輸入眾多用戶的使用歷史紀錄;利用最佳化方法分別求出用戶對物品以及物品對物品之模型;以及當需要作推薦時可透過模型的參數得到推薦序列。 The invention discloses a sequence recommendation method and a computer program product thereof. The method provided by the invention includes inputting usage history records of a plurality of users; using optimization methods to obtain user-to-item and article-to-item models respectively; and when needed When making a recommendation, the recommendation sequence can be obtained through the parameters of the model.

Description

序列推薦之方法    Sequence recommendation method   

本發明屬於一種序列推薦之方法,為利用最佳化方法分別求出用戶對物品以及物品對物品之模型,以及當需要作推薦時可透過模型的參數得到推薦序列。 The invention belongs to a sequence recommendation method. In order to obtain the user-to-item and article-to-item models by using an optimization method, and when a recommendation is needed, a recommended sequence can be obtained through the parameters of the model.

近年來由於網際網路的普及以及其基礎建設和相關技術的發展逐漸成熟,人們開始會透過網際網路完成許多商業行為,例如網路購物及網路拍賣等等。因此,「推薦系統」(recommendation systems)便成為了相當重要且受矚目的一項技術。藉由以往使用者們的大量瀏覽記錄和交易記錄等,我們可以想辦法「預測」使用者對一項產品或服務的滿意程度和喜好度,進而可以「推薦」使用者可能會感興趣的商品,而這通常即推薦系統的目標。 In recent years, due to the popularity of the Internet and the development of its infrastructure and related technologies, people have begun to complete many business activities through the Internet, such as online shopping and online auctions. Therefore, "recommendation systems" have become a very important and high-profile technology. With a large number of browsing history and transaction history of past users, we can think of ways to "predict" users' satisfaction and preference for a product or service, and then "recommend" products that users may be interested in , And this is usually the goal of the recommendation system.

現今許多網路購物平台都有使用推薦系統,也已有許多的專利發明與研究著眼與此。其中,大多數的發明幾乎都把重點放在推薦「單一物品」(single item as an entity)。然而,在一些應用的情境之下,需要作推薦的對象應該是「序列」(sequence),亦即「一連串有序(ordered)的項目」。對此,旅遊行程推薦便是一例,在一項旅遊行程應由一連串有順序的地點所組成;另外,像是音樂播放曲目表的推薦也是「序列推 薦」一個例子。 Many online shopping platforms today use recommendation systems, and there have been many patented inventions and studies focusing on this. Most of these inventions have focused on recommending "single item as an entity". However, in some application scenarios, the object to be recommended should be "sequence", that is, "a series of ordered items". In this regard, the travel itinerary recommendation is an example. A travel itinerary should consist of a sequence of places; in addition, recommendations such as a music playlist are also examples of “sequence recommendations”.

當然,對此種「序列推薦」的問題,我們可以簡單地使用已知之推薦單一物品的技巧來做推薦,但直接套用的話會直接面臨因維度提昇而產生的複雜度過高之問題。另外,序列物品擁有其每個項目前後關連之獨有特性。本發明提出了一原創的機率模型設計,期望能解決這個問題。 Of course, for this kind of "sequence recommendation" problem, we can simply use the known technique of recommending a single item to make a recommendation, but if applied directly, it will directly face the problem of excessive complexity caused by the dimensional improvement. In addition, serial items have unique characteristics related to each item before and after. The present invention proposes an original probability model design, which is expected to solve this problem.

而實際上,由於較好作效果的評估(performance evaluation),所以一般所說的推薦問題主要是以上方所列之第二種(預測評分值)為主。對此,前人已經提出了許多可以很好地解決的方法,例如矩陣分解(Matrix Factorization)、有限制性波茲曼機(Restricted Boltzmann Machine)和其他Collaborative Filtering的方法等等。然而,較少特別針對本發明之目標:「一般性的個人化序列推薦問題」作解決。對於「序列推薦問題」,有一些研究嘗試使用些規則基礎(rule-based)或是啟發式(heuristic)的方法來解決這個特殊的推薦問題。 In fact, due to better performance evaluation, the recommendation problem in general is mainly the second type (predicted score) listed above. In this regard, the predecessors have proposed many methods that can be well solved, such as Matrix Factorization, Restricted Boltzmann Machine, and other Collaborative Filtering methods. However, it is rarely addressed specifically to the object of the present invention: the "generalized personalized sequence recommendation problem". For the "sequence recommendation problem", some studies have tried to use some rule-based or heuristic methods to solve this special recommendation problem.

對於序列推薦系統之問題,Baccigalupo et al.[1]提出了一個case-based的方法應用於音樂播放列表推薦上,其方法是:首先先按照一些case的基底選出一些「已被觀測到」的序列(於訓練資料中之序列),之後再將它們以符合順序特性之方式重組成最後要推薦給使用者的序列。Ge et al.[2]則是針對行程推薦問題,並點出了其和傳統的推薦問題不同,但著重的點在於旅程推薦特有的金錢花費和時間花費之因素,為此他們設計了考慮這些花費的隱性因素模型(latent factor model)來完成序列推薦。而關於推薦結果之序列的組成,Ziegler et al.[3]則提出了主題變化(topic diversification)這點,設計了一個新的方法來平衡且使得推薦的序列具有變化 性而不單調。在以上的系統中,共同點為皆是將整個序列是視為單一個體(entity)來做判斷,而沒有考慮其中每個單一元素(element)。 For the problem of sequence recommendation system, Baccigalupo et al. [1] proposed a case-based method for music playlist recommendation. The method is as follows: first select some “observed” ones according to the case basis Sequences (sequences in the training data), and then recombining them into a sequence that is finally recommended to the user in a manner consistent with the sequence characteristics. Ge et al. [2] aimed at the itinerary recommendation problem, and pointed out that it is different from the traditional recommendation problem, but the focus is on the factors of money and time that are unique to the journey recommendation. Therefore, they designed and considered It takes a latent factor model to complete the sequence recommendation. Regarding the composition of the recommended results sequence, Ziegler et al. [3] proposed the topic diversification, and designed a new method to balance and make the recommended sequence changeable but not monotonous. In the above system, the common point is that the entire sequence is judged as a single entity, without considering each single element.

本案發明人鑑於上述習用方式所衍生的各項缺點,乃亟思加以改良創新,並經多年苦心孤詣潛心研究後,終於成功研發完成本序列推薦之方法。 In view of the various shortcomings derived from the above-mentioned conventional methods, the inventor of this case has been eager to improve and innovate. After years of painstaking research, he finally successfully developed the method recommended in this sequence.

為達上述目的,本發明提出提供一種序列推薦之方法,以兩種不同的矩陣來解決個人化序列推薦的問題,個人化矩陣紀錄了用戶和物品之間的採購次數或是喜好,物品歷程矩陣則是紀錄了上次採購商品與這次採購商品的關係。利用兩種模型的組合,可以獲得序列推薦資訊。而這兩種模型都可以轉換成一般的最佳化問題,快速的計算出來。 In order to achieve the above object, the present invention proposes to provide a sequence recommendation method, which uses two different matrices to solve the problem of personalized sequence recommendation. The personalization matrix records the number of purchases or preferences between users and items, and the item history matrix. It records the relationship between the last purchase of goods and this purchase. Using the combination of the two models, serial recommendation information can be obtained. Both models can be converted into general optimization problems and quickly calculated.

一種序列推薦之方法,包括:使用線上系統所蒐集之系統紀錄,產生訓練資料;根據訓練資料,使用最佳化演算法學習模型參數;評估目前的模型參數於資料集上之效能表現;參數是否最佳化;若否,則回根據訓練資料,使用最佳化演算法學習模型參數;若是,則建立實際的應用系統,完成個人化序列之推薦。 A sequence recommendation method includes: using system records collected by an online system to generate training data; using optimization algorithms to learn model parameters based on the training data; evaluating the performance of the current model parameters on the data set; whether the parameters are Optimization; if not, then use the optimization algorithm to learn the model parameters based on the training data; if so, establish an actual application system to complete the recommendation of the personalized sequence.

其蒐集之系統紀錄,是為蒐集用戶序列紀錄,若無序列紀錄,則利用紀錄中的時間資訊,將紀錄依照發生的時間順序轉換成序列,並將紀錄分成訓練集和驗證集,而訓練集,是為分別訓練出用戶對品項偏好模型與品項對品項順序模型, 並以矩陣的方式儲存。 The collected system records are used to collect user sequence records. If there are no sequence records, the time information in the records is used to convert the records into sequences according to the chronological order of occurrence. The records are divided into training sets and verification sets. Is to train user preference model and item-to-item order model respectively, and store them in matrix.

綜上所述,首先一、利用線上系統所記錄之各使用者各自的歷史序列記錄,來產生出具個人化要素的序列訓練資料,以蒐集用戶序列紀錄,若無序列紀錄,則利用紀錄中的時間資訊,將紀錄依照發生的時間順序轉換成序列,並將紀錄分成訓練集和驗證集,二、再利用具個人化要素的序列訓練資料,來建立目標的機器學習模型,並將所蒐集的用戶序列紀錄之訓練集,分別訓練出用戶對品項偏好模型與品項對品項順序模型,其二模型都是以矩陣的方式儲存,之後再以三、訓練集或驗證集做機器學習模型之效能評估,其利用機器學習模型進行序列推薦,並以驗證集,利用分歧度或是序位倒數方法,評估這次推薦之結果,如果未符合收斂條件,則回到第二步繼續訓練,如果符合收斂條件,則儲存該模型,其收斂條件可為相對條件或絕對條件,最後三、以評估完成的模型來建立實際的個人化序列推薦程序,將收斂的用戶對品項偏好模型與品項對品項順序模型作為放射矩陣與轉移矩陣,利用動態規劃的演算法可取得最佳推薦序列。 To sum up, firstly, use the historical sequence records of each user recorded in the online system to generate sequence training data with personalized elements to collect user sequence records. If there is no sequence record, use the Time information, the records are converted into sequences according to the chronological order of occurrence, and the records are divided into training sets and verification sets. Second, the sequence training data with personalized elements is used to build a target machine learning model and collect the collected data. The training set of the user sequence record separately trains the user's preference model and item-to-item order model for the item. The second model is stored in a matrix, and then the machine learning model is used as the training set or verification set. For performance evaluation, it uses a machine learning model to make sequence recommendations, and uses a validation set to evaluate the results of this recommendation using the degree of divergence or inverse order method. If the convergence conditions are not met, return to the second step to continue training. If the convergence conditions are met, the model is stored. The convergence conditions can be relative or absolute conditions. Complete model to establish the actual sequence of personalized recommendation program, the convergence of user preference model of food items and food items to food items sequential model as radiation matrix and transfer matrix using dynamic programming algorithm can obtain the best recommendation sequence.

本發明所提供一種序列推薦之方法,與其他習用技術相互比較時,更具備下列優點: The sequence recommendation method provided by the present invention has the following advantages when compared with other conventional technologies:

1. 根據訓練資料,自動學習出評估推薦效果的方式。 1. Based on the training materials, automatically learn the way to evaluate the recommended effect.

2. 根據前述的評估方式,以複雜度更低的方法建立序列推薦模型,產生最佳序列推薦。 2. According to the aforementioned evaluation method, establish a sequence recommendation model with a lower complexity method to generate the best sequence recommendation.

S110~S150‧‧‧推薦流程 S110 ~ S150‧‧‧Recommended process

請參閱有關本發明之詳細說明及其附圖,將可進一步瞭解本發明之技術內容及其目的功效;有關附圖為: 圖1為本發明序列推薦之方法之流程圖。 Please refer to the detailed description of the present invention and its accompanying drawings to further understand the technical content of the present invention and its purpose and effect. The related drawings are as follows: FIG. 1 is a flowchart of the method of the sequence recommendation of the present invention.

為了使本發明的目的、技術方案及優點更加清楚明白,下面結合附圖及實施例,對本發明進行進一步詳細說明。應當理解,此處所描述的具體實施例僅用以解釋本發明,但並不用於限定本發明。 In order to make the objectives, technical solutions, and advantages of the present invention clearer, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention, but not intended to limit the present invention.

以下,結合附圖對本發明進一步說明:請參閱圖1所示,一種序列推薦之方法,包括:S110使用線上系統所蒐集之系統紀錄,產生訓練資料;S120根據訓練資料,使用最佳化演算法學習模型參數;S130評估目前的模型參數於資料集上之效能表現;S140參數是否最佳化;若否,則回S120根據訓練資料,使用最佳化演算法學習模型參數;若是,則S150建立實際的應用系統,完成個人化序列之推薦。 Hereinafter, the present invention will be further described with reference to the accompanying drawings. Please refer to FIG. 1, a sequence recommendation method includes: S110 uses system records collected by an online system to generate training data; S120 uses an optimization algorithm based on the training data Learning model parameters; S130 evaluates the performance of the current model parameters on the data set; whether the S140 parameters are optimized; if not, returns to S120 to learn the model parameters using the optimization algorithm based on the training data; if yes, then S150 is established Practical application system to complete the recommendation of personalized sequence.

其蒐集之系統紀錄,是為蒐集用戶序列紀錄,若無序列紀錄,則利用紀錄中的時間資訊,將紀錄依照發生的時間順序轉換成序列,並將紀錄分成訓練集和驗證集,而訓練集,是為分別訓練出用戶對品項偏好模型與品項對品項順序模型,並以矩陣的方式儲存。 The collected system records are used to collect user sequence records. If there are no sequence records, the time information in the records is used to convert the records into sequences according to the chronological order of occurrence. The records are divided into training sets and verification sets. , Is to train the user preference model and item-to-item order model respectively, and store them in a matrix.

依照上述步驟,可同時參考下方實施例。 In accordance with the above steps, reference may be made to the following embodiments at the same time.

利用線上系統所記錄之各使用者各自的歷史序列記錄,來產生出具個人化要素的序列訓練資料。範例格式提供如下: user-id element-0 element-1 element-2... Using the historical sequence records of each user recorded in the online system to generate sequence training data with personalized elements. The sample format is provided as follows: user-id element-0 element-1 element-2 ...

其中user-id係指使用者編號,element-i則為序列中的第i個元素之編號。 Where user-id is the user number, and element-i is the number of the i- th element in the sequence.

利用所產生之序列訓練資料,來建立目標的機器學習模型。本發明將整個個人化序列推薦問題建模成一最佳化數學問題: Use the generated sequence training data to build a target machine learning model. The present invention models the entire personalized sequence recommendation problem as an optimized mathematical problem:

其中的L為整個資料集D在模型參數為Theta(θ)下之似然函數(likelihood function)值。 Where L is the likelihood function value of the entire data set D when the model parameter is Theta (θ).

而在第一階馬可夫假設(first-order Markov assumption)之下,整個式子可以被重寫為: Under the first-order Markov assumption, the entire expression can be rewritten as:

其中N為總序列數,而x i,k 代表第i個序列中的第k個元素,u i 為第i個序列代表的用戶,n i 為第i個用戶歷史紀錄的總筆數。 Where N is the total number of sequences, and X i, k i represents the sequence of the k-th element, U i is the i th user represented by the sequence, n-i-i is the total items in the user history.

對於此目標之最佳化問題,本發明將其中的條件機率設計成由(a)個人化推薦以及(b)序列特性兩部份所組成的勢能函數(potential function)r來建構之。整體條件機率對應於勢能函數的設計為: For the optimization of this goal, the present invention designs the conditional probability to be constructed by a potential function r composed of (a) a personalized recommendation and (b) a sequence characteristic. The design of the overall conditional probability corresponding to the potential energy function is:

上列方程式中,x表示從x i,k 的總集所抽取的一個元素,u代表從u i 的總集所抽取的一個用戶,a表示記錄中用戶上次購買的商品或服務,b表示記錄中用戶本次購買的商品或服務。 In the above equation, x represents an element extracted from the aggregate of x i, k , u represents a user extracted from the aggregate of u i , a represents the goods or services that the user last purchased in the record, and b represents the record in the record. The goods or services purchased by the user this time.

對於此勢能函數r,一具體實施例乃將其以兩組隱性矩陣(latent matrices)來建構之,以用於描述上述之(a)個人化推薦以及(b)序列特性等兩部份特性。其範例作法如下: For this potential energy function r , a specific embodiment is constructed with two sets of latent matrices, which are used to describe the above two characteristics of (a) personalized recommendations and (b) sequence characteristics. . The example method is as follows:

其中的p,q,w,h四個矩陣即為本模型之參數Theta(θ);而alpha(α)則是一事先決定好的常數,其值必須介於0至1,用於控制(a),(b)兩部份的比例。其中p、q和h為商品或服務對於某些喜好維度的評分,以餐廳為例,喜好維度可能是價格是否低廉、環境整潔度、是否好停車、是否有無障礙空間、餐點是否好吃等等。由於各類不同商品和服務差異性很大,不可能以羅列所有維度的方式進行,故需要以機器學習的方式建構。w是該用戶對於喜好維度的在意程度,也以餐廳為例,某些用戶可能比較不在意是否有無障礙空間,但非常在意環境整潔度,另一個用戶可能不在乎價格,只在意是否好吃。w這種偏好程度也必須透過用戶使用記錄,以機器學習的方式取得。 The four matrices p, q, w, and h are the parameters of the model, Theta (θ); and alpha (α) is a constant determined in advance, and its value must be between 0 and 1 for control ( a), (b) The ratio of the two parts. Among them, p, q, and h are the ratings of goods and services for certain preference dimensions. Taking restaurants as an example, the preference dimensions may be whether the price is low, the environment is clean, whether parking is good, whether there is accessible space, whether the meal is delicious, etc. Wait. Because different types of goods and services are so different that it is impossible to do it in a way that lists all dimensions, it needs to be constructed in a machine learning manner. w is how much the user cares about the preference dimension. Taking the restaurant as an example, some users may be less concerned about whether there is accessibility space, but very concerned about the cleanliness of the environment. Another user may not care about the price and only care about the deliciousness. w This degree of preference must also be obtained through user learning through machine learning.

在S120中係為學習模型參數(如上述之一具體實施例中的p,q,w,h)的過程。具體的學習方式可使用但不僅限於SGD(Stochastic Gradient Descent)最佳化方法。藉由機器學習的最佳化演算法,我們便可以得到一組在地最佳(local optimal)之模型參數。 In S120, it is a process of learning model parameters (such as p, q, w, h in a specific embodiment described above). Specific learning methods can use but are not limited to SGD (Stochastic Gradient Descent) optimization method. With the optimization algorithm of machine learning, we can get a set of local optimal model parameters.

利用所學習完畢之模型參數,來以各資料集(訓練資料、驗證資料)作效能之評估。本案舉例出二項具體實施例。 第一種具體實施例為Perplexity值,其公式表示如下: Use the learned model parameters to evaluate the performance of each data set (training data, verification data). This case exemplifies two specific embodiments. The first specific embodiment is a value of Perplexity, the formula of which is as follows:

其中D資料集為資料集,|D|為該資料集總共的筆數,s為其中一筆資料。 D data set is the data set, | D | is the total number of records in the data set, and s is one of the data.

此評估方式可用於得知整個系統的效能表現。其數學上之表現意義為平均分枝度(average branching factor),可作為本目標問題之衡量標準。Perplexity值愈低代表模型學習的成效愈好。而另一種具體實施例為序位倒數平均值(Mean Reciprocal Rank),此效能衡量標準可評量模型是否有將已被觀測到的序列(即出現在測試資料集中的序列)推薦在較優先的順序。於本問題中,其式子可展開如下: This evaluation method can be used to know the performance of the entire system. Its mathematical meaning is average branching factor, which can be used as a criterion for this objective problem. The lower the value of the Perplexity, the better the effect of model learning. Another specific embodiment is Mean Reciprocal Rank. This performance measure can evaluate whether the model recommends the sequences that have been observed (that is, the sequences that appear in the test data set) to be preferred. order. In this question, the formula can be expanded as follows:

其中gamma(i)為對於資料集D中的序列i所詢問的元素索引(index)。 Where gamma ( i ) is the index of the element queried for the sequence i in the data set D.

綜合以上,本步驟P300致於評估當前模型參數Theta(θ)於實際資料集的效能表現,並藉由其評估結果決定是否需繼續訓練並更新參數(即回到步驟P200);若評估結果之效能顯示出已達在地最佳表現之跡象,則進入完成整個個人化序列推薦系統。 To sum up, in this step P300, the performance of the current model parameter Theta (θ) on the actual data set is evaluated, and the evaluation result is used to determine whether to continue training and update the parameters (that is, return to step P200). If the effectiveness shows that it has reached the best performance in the local area, it will enter the complete personalized sequence recommendation system.

利用所訓練學習並評估完成的模型來建立實際的個人化序列推薦程序。對此,一實施例為:系統輸入:使用者編號(uid)、序列的長度、所求序列之開頭元素(element-0);系統輸出:所推薦的序列(element-1 to element-K); 而實際產生序列的方式,可使用但不僅限於序列中的一項element一項element依序產生,意即,根據所學習到的勢能函數建構出的條件機率,我們可以使用啟發式(heuristic)的方式產生出機率較高(對於使用者所輸入的資訊而言)的序列;實際的應用例子:用於推薦音樂清單(elements=tracks)、用於推薦旅遊行程(elements=landscapes)。 Use the trained model to learn and evaluate the completed model to establish an actual personalized sequence recommendation procedure. In this regard, an embodiment is: the system input: user ID (uid), the length of the sequence, the beginning element (element-0) of the requested sequence; the system output: the recommended sequence (element-1 to element-K) The way to actually generate a sequence can use but is not limited to one element in the sequence and one element is generated sequentially, which means that we can use heuristics based on the conditional probability constructed by the learned potential energy function. The method generates a sequence with a high probability (for the information entered by the user); practical application examples: for recommending music lists (elements = tracks), for recommending travel itineraries (elements = landscapes).

上列詳細說明乃針對本發明之一可行實施例進行具體說明,惟該實施例並非用以限制本發明之專利範圍,凡未脫離本發明技藝精神所為之等效實施或變更,均應包含於本案之專利範圍中。 The above detailed description is a specific description of a feasible embodiment of the present invention, but this embodiment is not intended to limit the patent scope of the present invention. Any equivalent implementation or change that does not depart from the technical spirit of the present invention should be included in Within the scope of the patent in this case.

綜上所述,本案不僅於技術思想上確屬創新,並具備習用之傳統方法所不及之上述多項功效,已充分符合新穎性及進步性之法定發明專利要件,爰依法提出申請,懇請 貴局核准本件發明專利申請案,以勵發明,至感德便。 To sum up, this case is not only innovative in terms of technical ideas, but also has many of the above-mentioned effects that are not used by traditional methods. It has fully met the requirements of statutory invention patents that are novel and progressive. To approve this invention patent application, to encourage invention, to the utmost convenience.

Claims (6)

一種序列推薦之方法,包括下列步驟:由電腦根據線上系統所蒐集之系統紀錄,產生訓練資料;由該電腦根據該訓練資料,使用機器學習的最佳化演算法學習模型參數;由該電腦評估該模型參數於資料集上之效能表現;由該電腦判斷該模型參數是否最佳化;若否,則由該電腦回到根據該訓練資料,使用該最佳化演算法學習該模型參數之步驟;若是,則由該電腦建立實際的應用系統,完成個人化序列之推薦;其中,由該電腦以個人化矩陣與物品歷程矩陣的組合獲得序列推薦資訊,該個人化矩陣記錄用戶和物品之間的採購次數或喜好,且該物品歷程矩陣記錄上次採購商品與這次採購商品的關係。A sequence recommendation method includes the following steps: a computer generates training data based on system records collected by an online system; the computer learns model parameters using an optimization algorithm of machine learning based on the training data; and the computer evaluates The performance of the model parameters on the data set; the computer judges whether the model parameters are optimized; if not, the computer returns to the step of learning the model parameters based on the training data and using the optimization algorithm ; If so, the computer establishes an actual application system to complete the recommendation of the personalized sequence; wherein the computer obtains the sequence recommendation information by a combination of a personalization matrix and an item history matrix, and the personalization matrix records the user and the item Number of purchases or preferences, and the item history matrix records the relationship between the last purchased product and this purchased product. 如申請專利範圍第1項所述之序列推薦之方法,其中,該所蒐集之系統紀錄,係為蒐集用戶序列紀錄,若無序列紀錄,則由該電腦利用紀錄中的時間資訊,將紀錄依照發生的時間順序轉換成序列,並將紀錄分成訓練集和驗證集。For example, the method of sequence recommendation described in item 1 of the scope of patent application, wherein the collected system records are to collect user sequence records. If there is no sequence record, the computer uses the time information in the record to record the record in accordance with The time sequence of occurrences is converted into a sequence, and the records are divided into a training set and a validation set. 如申請專利範圍第2項所述之序列推薦之方法,其中,該訓練集係為分別訓練出用戶對品項偏好模型與品項對品項順序模型,並以矩陣的方式儲存。The method of sequence recommendation as described in item 2 of the scope of the patent application, wherein the training set is to separately train the user preference model and item-to-item order model for the user and store them in a matrix. 一種序列推薦之方法,包括下列步驟:根據線上系統所蒐集之系統紀錄,產生訓練資料;根據該訓練資料,使用機器學習的最佳化演算法學習模型參數;評估該模型參數於資料集上之效能表現;判斷該模型參數是否最佳化;若否,則回到根據該訓練資料,使用該最佳化演算法學習該模型參數之步驟;若是,則建立實際的應用系統,完成個人化序列之推薦;其中,以個人化矩陣與物品歷程矩陣的組合獲得序列推薦資訊,該個人化矩陣記錄用戶和物品之間的採購次數或喜好,且該物品歷程矩陣記錄上次採購商品與這次採購商品的關係。A sequence recommendation method includes the following steps: generating training data based on system records collected by an online system; using the training data to learn model parameters using an optimization algorithm of machine learning; and evaluating the model parameters on the data set. Performance; judge whether the model parameters are optimized; if not, return to the step of learning the model parameters based on the training data and using the optimization algorithm; if so, establish an actual application system and complete the personalized sequence Recommendation; among which, the sequence recommendation information is obtained by a combination of a personalization matrix and an item history matrix, the personalization matrix records the number of purchases or preferences between the user and the item, and the item history matrix records the last purchased product and the current purchased product Relationship. 如申請專利範圍第4項所述之序列推薦之方法,其中,該所蒐集之系統紀錄,係為蒐集用戶序列紀錄,若無序列紀錄,則利用紀錄中的時間資訊,將紀錄依照發生的時間順序轉換成序列,並將紀錄分成訓練集和驗證集。The method of sequence recommendation as described in item 4 of the scope of patent application, wherein the collected system records are to collect user sequence records. If there is no sequence record, the time information in the record is used to record the record according to the time of occurrence. The sequence is converted into a sequence, and the records are divided into a training set and a validation set. 如申請專利範圍第5項所述之序列推薦之方法,其中,該訓練集係為分別訓練出用戶對品項偏好模型與品項對品項順序模型,並以矩陣的方式儲存。The method of sequence recommendation as described in item 5 of the scope of the patent application, wherein the training set is to train a user-item preference model and an item-to-item order model separately and store them in a matrix manner.
TW105135823A 2016-11-04 2016-11-04 Sequence recommendation method TWI660315B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW105135823A TWI660315B (en) 2016-11-04 2016-11-04 Sequence recommendation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW105135823A TWI660315B (en) 2016-11-04 2016-11-04 Sequence recommendation method

Publications (2)

Publication Number Publication Date
TW201818319A TW201818319A (en) 2018-05-16
TWI660315B true TWI660315B (en) 2019-05-21

Family

ID=62949633

Family Applications (1)

Application Number Title Priority Date Filing Date
TW105135823A TWI660315B (en) 2016-11-04 2016-11-04 Sequence recommendation method

Country Status (1)

Country Link
TW (1) TWI660315B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI499290B (en) * 2012-11-30 2015-09-01 Ind Tech Res Inst Information recommendation method and system
US20160283970A1 (en) * 2015-03-24 2016-09-29 Adobe Systems Incorporated Selecting digital advertising recommendation policies in light of risk and expected return

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI499290B (en) * 2012-11-30 2015-09-01 Ind Tech Res Inst Information recommendation method and system
US20160283970A1 (en) * 2015-03-24 2016-09-29 Adobe Systems Incorporated Selecting digital advertising recommendation policies in light of risk and expected return

Also Published As

Publication number Publication date
TW201818319A (en) 2018-05-16

Similar Documents

Publication Publication Date Title
US10789638B2 (en) Method and system for providing personalized on-location information exchange
US10706290B2 (en) Method and system for providing personalized on-location information exchange
Al-Gasawneh et al. The relationship between perceived destination image, social media interaction and travel intentions relating to Neom city
Bose et al. Quantitative models for direct marketing: A review from systems perspective
Jin et al. Development of a continuous usage model for the adoption and continuous usage of a smartphone
Bayus et al. Understanding customer needs
Ahn Evaluating customer aid functions of online stores with agent-based models of customer behavior and evolution strategy
CN109767032A (en) A kind of business finance operation digital management optimization system based on data analysis
Loshin et al. Using information to develop a culture of customer centricity: customer centricity, analytics, and information utilization
Chen Fuzzy dual experience-based design evaluation model for integrating engineering design into customer responses
Park et al. Mobile information recommendation using multi-criteria decision making with Bayesian network
Park et al. Spec guidance for engineering design based on data mining and neural networks
JP6360625B2 (en) Verification support system and method
US20200160359A1 (en) User-experience development system
TWI660315B (en) Sequence recommendation method
De Bock Advanced database marketing: innovative methodologies and applications for managing customer relationships
Raco et al. Strategic priority of students’ online buying behaviour in the pandemic era
Ji et al. Personalized recommendation based on a multilevel customer model
Tajuddin et al. Impacts of consumer-brand identification for strengthening the sustainability of Malaysian fashion brands
Barriga Artificial intelligence applied to marketing management: Trends and projections according to specialists
Annabathuni Mitigating the Cold-Start Problem by Leveraging Category Level Associations
Sajedikhah et al. Historical effect of verified purchases and ordinary users’ testimonials on the sales rank of experience and search goods
Szubartowicz The Challenges of Big Data-Contributions in the Field of Data Quality and Artificial Intelligence Applications
Lin et al. Modelling the Consumption Behaviour of Heterogeneous Consumers: A Duty-Free Shop Case Simulation Analysis
Smirnov et al. Multi-Aspect User Ontology for Intelligent Decision Support Based on Digital Footprints