Sciweavers

1701 search results - page 246 / 341
» Providing k-anonymity in data mining
Sort
View
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 4 months ago
A Computational Approach to Style in American Poetry
We develop a quantitative method to assess the style of American poems and to visualize a collection of poems in relation to one another. Qualitative poetry criticism helped guide...
David M. Kaplan, David M. Blei
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
14 years 4 months ago
News Aware Volatility Forecasting: Is the Content of News Important?
The efficient market hypothesis states that the market incorporates all available information to provide an accurate valuation of the asset at any given time. However, most models...
Calum Robertson, Shlomo Geva, Rodney Wolff
GFKL
2007
Springer
196views Data Mining» more  GFKL 2007»
14 years 4 months ago
Comparison of Recommender System Algorithms Focusing on the New-item and User-bias Problem
Recommender systems are used by an increasing number of e-commerce websites to help the customers to find suitable products from a large database. One of the most popular techniqu...
Stefan Hauger, Karen H. L. Tso, Lars Schmidt-Thiem...
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
14 years 4 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
14 years 4 months ago
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
François Fouss, Luh Yen, Alain Pirotte, Mar...