Sciweavers

3651 search results - page 518 / 731
» Data Mining for Security Applications
Sort
View
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 6 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 6 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
2007
ACM
156views Data Mining» more  KDD 2007»
16 years 6 months ago
Estimating rates of rare events at multiple resolutions
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrab...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 6 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 6 months ago
Modeling relationships at multiple scales to improve accuracy of large recommender systems
The collaborative filtering approach to recommender systems predicts user preferences for products or services by learning past useritem relationships. In this work, we propose no...
Robert M. Bell, Yehuda Koren, Chris Volinsky