Sciweavers

156 search results - page 13 / 32
» The UCI KDD Archive of Large Data Sets for Data Mining Resea...
Sort
View
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
13 years 11 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 8 months ago
Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
Vincent Yan Fu Tan, See-Kiong Ng
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
14 years 1 months ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 8 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 10 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...