Sciweavers

1701 search results - page 305 / 341
» Providing k-anonymity in data mining
Sort
View
KDD
2010
ACM
190views Data Mining» more  KDD 2010»
13 years 11 months ago
User browsing models: relevance versus examination
There has been considerable work on user browsing models for search engine results, both organic and sponsored. The click-through rate (CTR) of a result is the product of the prob...
Ramakrishnan Srikant, Sugato Basu, Ni Wang, Daryl ...
GFKL
2006
Springer
133views Data Mining» more  GFKL 2006»
13 years 11 months ago
Adaptive Conjoint Analysis for Pricing Music Downloads
Finding the right pricing for music downloads is of ample importance to the recording industry and music download service providers. For the recently introduced music downloads, re...
Christoph Breidert, Michael Hahsler
CIKM
2008
Springer
13 years 9 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
13 years 8 months ago
Towards Finding Valuable Topics
Enterprises depend on their information workers finding valuable information to be productive. However, existing enterprise search and recommendation systems can exploit few studi...
Zhen Wen, Ching-Yung Lin
FLAIRS
2004
13 years 8 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang