Traversal pattern mining in web environment

Authors:
MinSeok Jang;Weon-Goo Kim;Yon-sik Lee;Jongwook Woo
Affiliations:
Dept. of Computer Information Science, Kunsan National Univ., Kunsan, CheonBuk, Korea;School of Electronic and Information Eng., Kunsan National Univ., Kunsan, CheonBuk, Korea;Dept. of Computer Information Science, Kunsan National Univ., Kunsan, CheonBuk, Korea;Computer Information Systems Dept., California State Univ., Los Angeles, CA
Venue:
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Year:
2005

Citing 6
Cited 0

An effective hash-based algorithm for mining association rules

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques

Data mining: concepts and techniques
Efficient Data Mining for Path Traversal Patterns

IEEE Transactions on Knowledge and Data Engineering
Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment

TOOLS '99 Proceedings of the 31st International Conference on Technology of Object-Oriented Language and Systems
Data mining for path traversal patterns in a web environment

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

There have been researches about analyzing the information retrieval patterns of log file to obtain users’ information search patterns in web environment. Algorithms that find the frequently traversed path pattern from search path inputs are suggested mainly. But one of the existing works’ problems is to provide inadequate solution for complex, that is, general topological patterns. This paper suggests an efficient algorithm for deriving the maximal frequent traversal pattern from general paths.