本文關(guān)鍵詞： 易貨 電子易貨 電子商務(wù) 頻繁關(guān)聯(lián)　出處：《四川師范大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著互聯(lián)網(wǎng)的興起,電子易貨得到了迅猛的發(fā)展,通過電子易貨的交易模式可以使得國際和企業(yè)之間的資源得到再次交換和匹配,能夠極大的促進國家的經(jīng)濟發(fā)展和企業(yè)之間的業(yè)務(wù)流動。電子易貨交易中最大的難點是將易貨者之間的供需進行匹配,這需要通過合理有效的易貨匹配算法進行尋找。本文針對電子易貨資源匹配問題,將一次交易涉及交易數(shù)量最多作為算法的總目標,研究了一整套以供求關(guān)系有向圖模型為基礎(chǔ)的電子易貨交易平臺交易數(shù)據(jù)的挖掘與匹配算法。提出一種全新的基于頻繁關(guān)聯(lián)的電子易貨模型,并在單次交易匹配匹配和多人協(xié)同匹配兩種模式下進行了應(yīng)用。使用電子易貨匹配算法能夠有效的傳統(tǒng)易貨平臺過分依賴易貨經(jīng)濟人,商品無法自動匹配交易等問題。本文研究的工作主要包括以下兩個方面:(一)對每個易貨者每次只能提交一個需求和一個供給資源的單次交易匹配模式易貨算法進行改進。本文提出基于頻繁關(guān)聯(lián)的易貨算法,首先將電子易貨中的冗余數(shù)據(jù)進行清理,排除不能成環(huán)的交易記錄;其次,根據(jù)資源匹配中各個易貨者所提供的資源與其他易貨者資源關(guān)聯(lián)的頻數(shù)(Frequency)對參與的易貨者進行排序,選取出評分最高的易貨者作為遍歷環(huán)的開頭,并在隨后的每一個分支節(jié)點時都根據(jù)排序的評分來選擇相應(yīng)的易貨者作為優(yōu)先遍歷者,快速找出最長不相交環(huán)。通過實驗與傳統(tǒng)遍歷算法相比取得較好的改進效果。(二)對多人協(xié)同易貨模式的易貨算法進行實現(xiàn)。由于涉及易貨者之間的協(xié)同交易,其解決方案是一種NP難題,匹配實現(xiàn)的主要難度在于方案的最終結(jié)果不能確定是否為可行的。在本文中,首先,將電子易貨中的冗余數(shù)據(jù)進行清理;其次,根據(jù)資源匹配中各個易貨者所提供的資源與其他易貨者資源關(guān)聯(lián)的頻數(shù)(Frequency)對參與的易貨者進行排序,選擇擬匹配隊列的方式將易貨者的需求逐步進行滿足,從而全面搜索多人協(xié)同模式下的交易可能方案。實驗證明該算法能夠在多人協(xié)同模式的數(shù)據(jù)中得到良好的匹配結(jié)果。
[Abstract]:With the rise of the Internet, electronic barter has been a rapid development, through the electronic barter transaction model can make international and enterprise resources to be re-exchanged and matched. Can greatly promote the economic development of the country and business flows between enterprises. The biggest difficulty in electronic barter transactions is to match the supply and demand between barter. This needs to be found through a reasonable and effective barter matching algorithm. Aiming at the problem of electronic barter resource matching, the maximum number of transactions involved in a transaction is regarded as the total target of the algorithm in this paper. This paper studies a set of data mining and matching algorithms of electronic barter trading platform based on the digraph model of supply and demand relationship, and proposes a new electronic barter model based on frequent correlation. It is applied in the two modes of single transaction matching and multi-person co-matching. Using electronic barter matching algorithm, the traditional barter platform can rely too much on barter. The work of this paper mainly includes the following two aspects: (1). This paper improves the single transaction matching pattern barter algorithm that each barter can only submit one demand and one supply resource at a time. This paper proposes a barter algorithm based on frequent association. First of all, the redundant data in electronic barter is cleaned out to eliminate the transaction records that can not be looped. Secondly, according to the resources provided by each barter in the resource matching and other barter resources associated with the frequency of frequent) to participate in the barter ranking. The barter with the highest score is selected as the beginning of the traversal loop, and the corresponding barter is selected as the priority traversal at each subsequent branch node according to the ranking score. Find out the longest disjoint loop quickly. Compared with the traditional ergodic algorithm, the experiment has better effect. (2). This paper implements the barter algorithm of multi-person cooperative barter pattern, which involves the cooperative transaction among barter. The solution is a kind of NP problem, the main difficulty of matching implementation is that the final result of the scheme can not be determined whether it is feasible or not. In this paper, firstly, the redundant data in electronic barter are cleaned up. Secondly, according to the resources provided by each barter in the resource matching and other barter resources associated with the frequency of frequent) to participate in the barter ranking. Choosing the way to match the queue will gradually satisfy the barter's needs. The experiment results show that the algorithm can get a good matching result in the data of multi-person cooperative pattern.
【學(xué)位授予單位】：四川師范大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP301.6;F713.36

【參考文獻】

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

1 李聰;馬麗;;e-BRM:面向電子易貨的多維信譽模型[J];現(xiàn)代圖書情報技術(shù);2015年Z1期

2 張貝貝;王偉男;伊博麗;;易貨貿(mào)易:中小企業(yè)的另一種選擇[J];對外經(jīng)貿(mào);2013年12期

3 吳劍云;張嵩;;電子易貨資源匹配模型研究[J];管理工程學(xué)報;2012年01期

4 陳向;劉義;柴躍廷;;基于圖論的電子易貨商品自動匹配系統(tǒng)[J];計算機工程;2009年17期

5 孫亞娟;;我國現(xiàn)代易貨貿(mào)易模式探討[J];特區(qū)經(jīng)濟;2008年11期

6 俞榮根;丁新正;;中國-東盟自由貿(mào)易區(qū)中的易貨貿(mào)易[J];重慶郵電大學(xué)學(xué)報(社會科學(xué)版);2008年04期

7 洪濤;;加快我國現(xiàn)代易貨貿(mào)易的發(fā)展[J];北京工商大學(xué)學(xué)報(社會科學(xué)版);2007年04期

8 樊凡;;門戶網(wǎng)站——現(xiàn)代易貨貿(mào)易發(fā)展的基礎(chǔ)[J];沿海企業(yè)與科技;2007年04期

9 顏躍進,李舟軍,陳火旺;一種挖掘最大頻繁項集的深度優(yōu)先算法[J];計算機研究與發(fā)展;2005年03期

10 蔡珍貴;論電子商務(wù)模式下中國易貨貿(mào)易的發(fā)展機遇[J];經(jīng)濟論壇;2004年23期

相關(guān)碩士學(xué)位論文 前1條

1 郭春燕;基于SOA的企業(yè)應(yīng)用的研究與實現(xiàn)[D];大連理工大學(xué);2006年

，

本文編號：1469285