DocumentCode
184984
Title
Research on the Path Sorting Efficiency of TFTA Back-Tracing Algorithm Based on the Concept of Entropy
Author
Meiwen Guo ; Liang Wu ; Jianping Peng
Author_Institution
Sch. of Manage., Sun Yat-sen Univ., Guangzhou, China
fYear
2014
fDate
5-7 Nov. 2014
Firstpage
264
Lastpage
267
Abstract
There is often a large random arrangement in the consumer data when using TFTA back-tracing algorithm to mine and analyze the customers´ back-tracing buying behaviors in their web browse and purchase path. The disordered data structure reduces the computational efficiency and makes the result lack objectivity and practicality. The priority algorithm of path Entropy and path node entropy analysis method can identify the path with low entropy and high probability of consumption, then, advance the path of low entropy, and amend the path of high entropy. This process will help the system to change the structure of path information, improve its accuracy and degree of order, and in the end achieve the purpose of improving the efficiency of path sorting.
Keywords
consumer behaviour; data mining; entropy; fuzzy set theory; probability; TFTA back-tracing algorithm; Web browse path; computational efficiency; consumer data; customer back-tracing buying behavior mining; disordered data structure; entropy concept; mining traversal patterns using an fuzzy time-interval analying approach; path node entropy analysis method; path sorting efficiency; priority algorithm; purchase path; Algorithm design and analysis; Data mining; Educational institutions; Entropy; Fuzzy sets; Information entropy; Sorting; TFTA back-tracing algorithm; entropy; path; sorting efficiency;
fLanguage
English
Publisher
ieee
Conference_Titel
e-Business Engineering (ICEBE), 2014 IEEE 11th International Conference on
Conference_Location
Guangzhou
Print_ISBN
978-1-4799-6562-5
Type
conf
DOI
10.1109/ICEBE.2014.52
Filename
6982090
Link To Document