273 search results - page 49 / 55 » Mining association rules from imprecise ordinal data |
KDD
1999
ACM
15 years 1 months ago
1999
ACM
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
86
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
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...
APWEB
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present WBext (Web Browser extended), a web browser extended with client-side mining capabilities. WBext learns sophisticated user interests and browsing habits by tai...
WISE
2002
Springer
15 years 2 months ago
2002
Springer
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data sca...
89
Voted
PKDD
2007
Springer
15 years 3 months ago
2007
Springer
Randomized Response techniques have been empirically investigated in privacy preserving association rule mining. However, previous research on privacy preserving market basket data...