Sciweavers

391 search results - page 2 / 79
» Efficient Data Mining for Path Traversal Patterns
Sort
View
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
14 years 5 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
APWEB
2006
Springer
13 years 9 months ago
An Effective System for Mining Web Log
The WWW provides a simple yet effective media for users to search, browse, and retrieve information in the Web. Web log mining is a promising tool to study user behaviors, which co...
Zhenglu Yang, Yitong Wang, Masaru Kitsuregawa
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
14 years 5 months ago
Sequential PAttern mining using a bitmap representation
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Y...
WWW
2009
ACM
14 years 6 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
CCCG
2010
13 years 6 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh