Sciweavers

1022 search results - page 180 / 205
» New models and algorithms for programmable networks
Sort
View
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
13 years 2 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
DCOSS
2009
Springer
15 years 7 months ago
Detection and Localization Sensor Assignment with Exact and Fuzzy Locations
Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplifi...
Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro...
NECO
2006
157views more  NECO 2006»
15 years 12 days ago
Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
Durga L. Shrestha, Dimitri P. Solomatine
103
Voted
AAAI
2011
14 years 14 days ago
Relational Blocking for Causal Discovery
Blocking is a technique commonly used in manual statistical analysis to account for confounding variables. However, blocking is not currently used in automated learning algorithms...
Matthew J. Rattigan, Marc E. Maier, David Jensen
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
16 years 1 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...