Sciweavers

1859 search results - page 213 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
MM
2010
ACM
174views Multimedia» more  MM 2010»
15 years 5 months ago
Image classification using the web graph
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
Dhruv Kumar Mahajan, Malcolm Slaney
IMC
2010
ACM
15 years 3 months ago
Temporally oblivious anomaly detection on large networks using functional peers
Previous methods of network anomaly detection have focused on defining a temporal model of what is "normal," and flagging the "abnormal" activity that does not...
Kevin M. Carter, Richard Lippmann, Stephen W. Boye...
SAC
2009
ACM
15 years 12 months ago
Combining statistics and semantics via ensemble model for document clustering
Incorporating background knowledge into data mining algorithms is an important but challenging problem. Current approaches in semi-supervised learning require explicit knowledge p...
Samah Jamal Fodeh, William F. Punch, Pang-Ning Tan
ICML
2004
IEEE
15 years 10 months ago
Gradient LASSO for feature selection
LASSO (Least Absolute Shrinkage and Selection Operator) is a useful tool to achieve the shrinkage and variable selection simultaneously. Since LASSO uses the L1 penalty, the optim...
Yongdai Kim, Jinseog Kim
ICMCS
2009
IEEE
415views Multimedia» more  ICMCS 2009»
15 years 2 months ago
A new localized superpixel Markov random field for image segmentation
In this paper, we present a novel localized Markov random field (MRF) method based on superpixels for region segmentation. Early vision problems could be formulated as pixel label...
Xiaofeng Wang, Xiao-Ping Zhang