Sciweavers

49 search results - page 8 / 10
» Evaluating the markov assumption for web usage mining
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Fast inference and learning in large-state-space HMMs
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
Sajid M. Siddiqi, Andrew W. Moore
CIKM
2006
Springer
14 years 9 days ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
WWW
2004
ACM
14 years 9 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
ICWE
2009
Springer
13 years 6 months ago
Fine-Grained Analysis of Web Tasks through Data Visualization
Abstract. This paper presents an approach for monitoring several important aspects related to user behaviour during the execution of Web tasks1 . The approach includes the tracking...
Gennaro Costagliola, Vittorio Fuccella
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth