Mining patterns from graph traversals

被引：54

作者：

Nanopoulos, A

Manolopoulos, Y ^{[1
]}

机构：

[1] Univ Cyprus, Dept Comp Sci, CY-1678 Nicosia, Cyprus

[2] Aristotle Univ Thessaloniki, Dept Informat, Data Engn Lab, GR-54006 Thessaloniki, Greece

来源：

DATA & KNOWLEDGE ENGINEERING | 2001年 / 37卷 / 03期

关键词：

Web log mining; path traversal; graph model;

D O I：

10.1016/S0169-023X(01)00008-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In data models that have graph representations, users navigate following the links of the graph structure. Conducting data mining on collected information about user accesses in such models, involves the determination of frequently occurring access sequences. In this paper, the problem of finding traversal patterns from such collections is examined. The determination of patterns is based on the graph structure of the model. For this purpose, three algorithms, one which is level-wise with respect to the lengths of the patterns and two which are not are presented. Additionally, we consider the fact that accesses within patterns may be interleaved with random accesses due to navigational purposes. The definition of the pattern type generalizes existing ones in order to take into account this fact. The performance of all algorithms and their sensitivity to several parameters is examined experimentally. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：243 / 266

页数：24

共 23 条

[11]

Cooley R., 1999, Knowledge and Information Systems, V1, P5

[12]

Joshi Karuna P., 1999, P 2 INT WORKSHOP WEB, P63, DOI [10.1145/319759.319792, DOI 10.1145/319759.319792]

[13]

MADRIA SK, 1999, P 1 INT C DAT WAR KN, P303

[14]

NANOPOULOS A, 2000, P E EUR C ADV DAT IN, P215

[15]

NODINE MH, 1993, P 12 ANN ACM S PRINC, P222

[16]

Park JS, 1997, IEEE T KNOWL DATA EN, V9, P813, DOI 10.1109/69.634757

[17]

PEI J, 2000, P PAC AS C KNOWL DIS

[18]

SPILIOPOULOU M, 1999, LNCS, V1590

[19]

Toivonen H, 1996, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P134

[20]

WANG K, 1998, P ACM SIGIR INT C RE, P146

← 1 2 3 →