Sciweavers

499 search results - page 73 / 100
» PRICES: An Efficient Algorithm for Mining Association Rules
Sort
View
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 7 months ago
Document stream clustering: experimenting an incremental algorithm and AR-based tools for highlighting dynamic trends
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
Alain Lelu, Martine Cadot, Pascal Cuxac
WWW
2006
ACM
14 years 8 months ago
Mining related queries from search engine query logs
In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries...
Xiaodong Shi, Christopher C. Yang
KDD
1995
ACM
130views Data Mining» more  KDD 1995»
13 years 11 months ago
Compression-Based Evaluation of Partial Determinations
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
Bernhard Pfahringer, Stefan Kramer
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
PODS
2003
ACM
156views Database» more  PODS 2003»
14 years 7 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...