Sciweavers

2020 search results - page 113 / 404
» KDD Process Planning
Sort
View
KDD
2006
ACM
185views Data Mining» more  KDD 2006»
16 years 4 months ago
How to Define Searching Sessions on Web Search Engines
We investigate three methods for defining a session on Web search engines. We examine 2,465,145 interactions from 534,507 Web searchers. We compare defining sessions using: 1) Int...
Bernard J. Jansen, Amanda Spink, Vinish Kathuria
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 4 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 4 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 4 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 4 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen