Sciweavers

275 search results - page 29 / 55
» Scalable Data Mining with Model Constraints
Sort
View
NIPS
2008
13 years 9 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
WWW
2010
ACM
13 years 7 months ago
Mining advertiser-specific user behavior using adfactors
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishna...
KDD
2012
ACM
188views Data Mining» more  KDD 2012»
11 years 10 months ago
A probabilistic model for multimodal hash function learning
In recent years, both hashing-based similarity search and multimodal similarity search have aroused much research interest in the data mining and other communities. While hashing-...
Yi Zhen, Dit-Yan Yeung
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 8 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
EDM
2008
108views Data Mining» more  EDM 2008»
13 years 9 months ago
Do Students Who See More Concepts in an ITS Learn More?
Active engagement in the subject material has been strongly linked to deeper learning. In traditional teaching environments, even though the student might be presented with new con...
Moffat Mathews, Tanja Mitrovic