Sciweavers

KDD
2008
ACM
143views Data Mining» more  KDD 2008»
14 years 4 months ago
Detecting privacy leaks using corpus-based association rules
Richard Chow, Philippe Golle, Jessica Staddon
KDD
2008
ACM
117views Data Mining» more  KDD 2008»
14 years 4 months ago
Relational learning via collective matrix factorization
Ajit Paul Singh, Geoffrey J. Gordon
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
14 years 4 months ago
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
Lei Li, Wenjie Fu, Fan Guo, Todd C. Mowry, Christo...
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 4 months ago
Spotting out emerging artists using geo-aware analysis of P2P query strings
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel
KDD
2008
ACM
157views Data Mining» more  KDD 2008»
14 years 4 months ago
Banded structure in binary matrices
Gemma C. Garriga, Esa Junttila, Heikki Mannila
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 4 months ago
Mobile call graphs: beyond power-law and lognormal distributions
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
Mukund Seshadri, Sridhar Machiraju, Ashwin Sridhar...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 4 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 4 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2008
ACM
110views Data Mining» more  KDD 2008»
14 years 4 months ago
Mining preferences from superior and inferior examples
Mining user preferences plays a critical role in many important applications such as customer relationship management (CRM), product and service recommendation, and marketing camp...
Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, ...
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
14 years 4 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan