Sciweavers

124 search results - page 24 / 25
» Quantitative evaluation of approximate frequent pattern mini...
Sort
View
EOR
2007
96views more  EOR 2007»
13 years 5 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
KDD
2006
ACM
127views Data Mining» more  KDD 2006»
14 years 5 months ago
Recommendation method for extending subscription periods
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
Tomoharu Iwata, Kazumi Saito, Takeshi Yamada
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 5 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
14 years 5 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
14 years 5 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi