130 search results - page 16 / 26 » Revealing Paths of Relevant Information in Web Graphs |
WWW
2009
ACM
14 years 8 months ago
2009
ACM
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...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this informa...
CHI
2004
ACM
14 years 7 months ago
2004
ACM
This paper describes the concepts of TEA, a flexible tool that supports user tests by automating repetitive tasks and collecting data of user inputs and actions. TEA was specifica...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...