Sciweavers

KDD
2012
ACM
281views Data Mining» more  KDD 2012»
11 years 7 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»
11 years 7 months ago
Sampling minimal frequent boolean (DNF) patterns
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
Geng Li, Mohammed J. Zaki
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
11 years 7 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
11 years 7 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 7 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 7 months ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
11 years 7 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
KDD
2012
ACM
199views Data Mining» more  KDD 2012»
11 years 7 months ago
Trustworthy online controlled experiments: five puzzling outcomes explained
Online controlled experiments are often utilized to make datadriven decisions at Amazon, Microsoft, eBay, Facebook, Google, Yahoo, Zynga, and at many other companies. While the th...
Ron Kohavi, Alex Deng, Brian Frasca, Roger Longbot...
KDD
2012
ACM
220views Data Mining» more  KDD 2012»
11 years 7 months ago
ComSoc: adaptive transfer of user behaviors over composite social network
Accurate prediction of user behaviors is important for many social media applications, including social marketing, personalization and recommendation, etc. A major challenge lies ...
ErHeng Zhong, Wei Fan, Junwei Wang, Lei Xiao, Yong...
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 7 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...