Sciweavers

1091 search results - page 92 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
TKDE
2012
270views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
UAI
1998
13 years 9 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
ADC
2003
Springer
94views Database» more  ADC 2003»
14 years 1 months ago
Multi-resolution Algorithms for Building Spatial Histograms
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
Qing Liu, Yidong Yuan, Xuemin Lin
ECCC
2008
108views more  ECCC 2008»
13 years 8 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
ICML
2008
IEEE
14 years 8 months ago
Learning to classify with missing and corrupted features
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
Ofer Dekel, Ohad Shamir