Sciweavers

2372 search results - page 261 / 475
» is 2012
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
12 years 1 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
12 years 1 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
12 years 1 months ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
12 years 1 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
12 years 1 months ago
Unsupervised feature selection for linked social media data
The prevalent use of social media produces mountains of unlabeled, high-dimensional data. Feature selection has been shown effective in dealing with high-dimensional data for eï¬...
Jiliang Tang, Huan Liu