Mining Preferred Traversal Paths with HITS

Authors:
Jieh-Shan Yeh;Ying-Lin Lin;Yu-Cheng Chen
Affiliations:
Department of Computer Science and Information Management, Providence University, Taichung, Taiwan 433;Department of Computer Science and Information Management, Providence University, Taichung, Taiwan 433;Department of Computer Science and Information Management, Providence University, Taichung, Taiwan 433
Venue:
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Year:
2009

Citing 10
Cited 0

Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Efficient mining of weighted association rules (WAR)

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Web mining research: a survey

ACM SIGKDD Explorations Newsletter
Efficient Data Mining for Path Traversal Patterns

IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Web Mining: Information and Pattern Discovery on the World Wide Web

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Weighted Association Rule Mining using weighted support and significance framework

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Weighted Association Rules without Preassigned Weights

IEEE Transactions on Knowledge and Data Engineering
Web mining of preferred traversal patterns in fuzzy environments

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

Web usage mining can discover useful information hidden in web logs data. However, many previous algorithms do not consider the structure of web pages, but regard all web pages with the same importance. This paper utilizes HITS values and PNT preferences as measures to mine users' preferred traversal paths. Wë structure mining uses HITS (hypertext induced topic selection) to rank web pages. PNT (preferred navigation tree) is an algorithm that finds users' preferred navigation paths. This paper introduces the Preferred Navigation Tree with HITS (PNTH) algorithm, which is an extension of PNT. This algorithm uses the concept of PNT and takes into account the relationships among web pages using HITS algorithm. This algorithm is suitable for E-commerce applications such as improving web site design and web server performance.