Sciweavers

12863 search results - page 868 / 2573
» Dynamic Data Mining
Sort
View
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 8 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
162views Data Mining» more  KDD 2005»
16 years 8 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
181views Data Mining» more  KDD 2005»
16 years 8 months ago
Evaluating similarity measures: a large-scale study in the orkut social network
Online information services have grown too large for users to navigate without the help of automated tools such as collaborative filtering, which makes recommendations to users ba...
Ellen Spertus, Mehran Sahami, Orkut Buyukkokten
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
16 years 8 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu