Presentation is loading. Please wait.

Presentation is loading. Please wait.

Mining Path Traversal Patterns with User Interaction for Query Recommendation 龚赛赛 2013-05-28.

Published byLanny Gunawan Modified over 5 years ago

Similar presentations

Presentation on theme: "Mining Path Traversal Patterns with User Interaction for Query Recommendation 龚赛赛 2013-05-28."— Presentation transcript:

1 Mining Path Traversal Patterns with User Interaction for Query Recommendation
龚赛赛

2 Contents Background and motivation Idea of approach Problem statement Related work Sketch of our solution Discussion

3 Background View Entity and Navigate between Entities
View, Filter Collection and Navigation between Collections

4 Fig. b helps us know about Nanjing Better!
Background Navigation via links for better understanding dbpedia:Nanjing Fig. a.  Historical incident  of Nanjing from SView Fig. b. New version adding the combatant information Fig. b helps us know about Nanjing Better!

5 Background Information Overload

6 Motivation Query recommendation
Show some information in advance to enhance user viewing experience Explore less neighbors, while Know about the current entity better Help user find information he is interested in Filter Further navigation

7 Relieve user’s burden of query construction
Idea of approach Relieve user’s burden of query construction Combine usage mining and user interaction Mine navigation patterns from logs and then formulate queries according to patterns Leverage user interaction in mining and query formulation e.g. Save/Hide/Modify recommended queries Currently, mining path traversal patterns combined with user interaction

8 Problem statement P11 P21 P31 e1 e2 e3 e6 P22 P32 T31 P12 e7 e4 L12 C1
L41,v41 L31,v31 C4 C3 e:实体 C: 集合 T:类 P, L:属性 (L,v): filter L32 e5

9 Problem statement Given an entity or a collection, recommend some path based queries starting from the of the entity or collection Challenges Data preparation: session, user identification, sequence generation Time and storage requirements Usefulness of queries such as interesting, preference Reasoning How to combine mining and user interaction

10 Frequent Path Traversal Patterns Mining
Related Work Frequent Path Traversal Patterns Mining Apriori like Candidate generation and checking BFS: join and pruning Support and Confidence Reduce database scan and candidates FP-growth Hashing Partition Sampling ……

11 Related Work Chen at al. 98 Determine maximal forward references from logs maximal forward reference: DFS Determine large reference sequence from the set of maximal forward references join if contains or contains Determine maximal reference sequences from large reference sequences Chen et al. Efficient Data Mining for Path Traversal Patterns, IEEE transactions on knowledge and data engineering,1998

12 Related Work Chen at al. 98 ABCD ABEGH ABEGW AOU AOV

13 Related Work El-Sayed et al. FS-tree
Mining frequent pattern without candidate generation by using prefix tree (FP-growth) El-Sayed et al. FS-Miner: Efficient and Incremental Mining of Frequent Sequence Patterns in Web logs. WIDM’04

14 Related Work El-Sayed et al. FS-tree

15 Related Work El-Sayed et al.

16 Related Work El-Sayed et al.

17 Related Work Multiple Level Mining
Srikant R 95. Basic Idea: Give support at each level. Add ancestors of each item into the original data. Use adapted Apriori Srikant R, Agrawal R. Mining generalized association rules[M]. IBM Research Division, 1995.

18 Following is a draft of solution.
Sketch of our solution Following is a draft of solution. For each user, mine frequent path traversal patterns by adapted method of Chen (Personalization) Data preparation Identify each session data from logs In each session, simplify filter to property by ignoring the value in the filter Apriori support: number of sessions containing the specified (sub)path pattern. Discard reasoning at present

19 Sketch of our solution (Continue)
For each user, mine frequent path traversal patterns with user interaction Three types of interaction: bookmark(maybe give a name), hide the query of the relevant path pattern(not shown again), add the tail of the path pattern (the tail may not be logged) Bookmark and adding tail: add frequent path patterns that will in turn leveraged in candidate generation Hiding the query: add infrequent path patterns that will be in turn leveraged in pruning.

20 Sketch of our solution Mining frequent path traversal patterns from all users’ navigation behavior Candidate pattern: all users’ frequent path pattern A candidate path pattern is frequent if enough number of users having the pattern With a path traversal pattern, it is trivial to construct a relevant query

21 Discussion Restrictions:
Mining from all users’ navigation behavior appears simple The value in filter is discarded The order of consecutive filters on the same collection may be not important Class information on the vertex discarded No reasoning

Download ppt "Mining Path Traversal Patterns with User Interaction for Query Recommendation 龚赛赛 2013-05-28."

Similar presentations

Mining Association Rules

Mining Association Rules
Frequent Itemset Mining Methods. The Apriori algorithm Finding frequent itemsets using candidate generation Seminal algorithm proposed by R. Agrawal and.

Frequent Itemset Mining Methods. The Apriori algorithm Finding frequent itemsets using candidate generation Seminal algorithm proposed by R. Agrawal and.
Mining Frequent Patterns Using FP-Growth Method Ivan Tanasić Department of Computer Engineering and Computer Science, School of Electrical.

Mining Frequent Patterns Using FP-Growth Method Ivan Tanasić Department of Computer Engineering and Computer Science, School of Electrical.
Graph Mining Laks V.S. Lakshmanan

Graph Mining Laks V.S. Lakshmanan
Data e Web Mining Paolo Gobbo

Data e Web Mining Paolo Gobbo
Query Optimization of Frequent Itemset Mining on Multiple Databases Mining on Multiple Databases David Fuhry Department of Computer Science Kent State.

Query Optimization of Frequent Itemset Mining on Multiple Databases Mining on Multiple Databases David Fuhry Department of Computer Science Kent State.
10 -1 Lecture 10 Association Rules Mining Topics –Basics –Mining Frequent Patterns –Mining Frequent Sequential Patterns –Applications.

10 -1 Lecture 10 Association Rules Mining Topics –Basics –Mining Frequent Patterns –Mining Frequent Sequential Patterns –Applications.
Chase Repp.  knowledge discovery  searching, analyzing, and sifting through large data sets to find new patterns, trends, and relationships contained.

Chase Repp.  knowledge discovery  searching, analyzing, and sifting through large data sets to find new patterns, trends, and relationships contained.
ICDM'06 Panel 1 Apriori Algorithm Rakesh Agrawal Ramakrishnan Srikant (description by C. Faloutsos)

ICDM'06 Panel 1 Apriori Algorithm Rakesh Agrawal Ramakrishnan Srikant (description by C. Faloutsos)
FP-Growth algorithm Vasiljevic Vladica,

FP-Growth algorithm Vasiljevic Vladica,
Rakesh Agrawal Ramakrishnan Srikant

Rakesh Agrawal Ramakrishnan Srikant
IncSpan: Incremental Mining of Sequential Patterns in Large Databases Hong Cheng,Xifeng Yan,Jiawei Han University of Illinois at Urbana-Champaign.

IncSpan: Incremental Mining of Sequential Patterns in Large Databases Hong Cheng,Xifeng Yan,Jiawei Han University of Illinois at Urbana-Champaign.
© Vipin Kumar CSci 8980 Fall 2002 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance Computing Research Center Department of Computer.

© Vipin Kumar CSci 8980 Fall CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance Computing Research Center Department of Computer.
1 IncSpan :Incremental Mining of Sequential Patterns in Large Database Hong Cheng, Xifeng Yan, Jiawei Han Proc. 2004 Int. Conf. on Knowledge Discovery.

1 IncSpan :Incremental Mining of Sequential Patterns in Large Database Hong Cheng, Xifeng Yan, Jiawei Han Proc Int. Conf. on Knowledge Discovery.
Data Mining Association Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 6 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,

Data Mining Association Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 6 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,
732A02 Data Mining - Clustering and Association Analysis ………………… Jose M. Peña Association rules Apriori algorithm FP grow algorithm.

732A02 Data Mining - Clustering and Association Analysis ………………… Jose M. Peña Association rules Apriori algorithm FP grow algorithm.
Mining Time-Series Databases Mohamed G. Elfeky. Introduction A Time-Series Database is a database that contains data for each point in time. Examples:

Mining Time-Series Databases Mohamed G. Elfeky. Introduction A Time-Series Database is a database that contains data for each point in time. Examples:
1 Mining Frequent Patterns Without Candidate Generation Apriori-like algorithm suffers from long patterns or quite low minimum support thresholds. Two.

1 Mining Frequent Patterns Without Candidate Generation Apriori-like algorithm suffers from long patterns or quite low minimum support thresholds. Two.
Association Analysis: Basic Concepts and Algorithms.

Association Analysis: Basic Concepts and Algorithms.
Association Rule Mining. Generating assoc. rules from frequent itemsets  Assume that we have discovered the frequent itemsets and their support  How.

Association Rule Mining. Generating assoc. rules from frequent itemsets  Assume that we have discovered the frequent itemsets and their support  How.

Similar presentations

Ads by Google