Sciweavers

282 search results - page 49 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
JMLR
2010
108views more  JMLR 2010»
13 years 2 months ago
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
Taiji Suzuki, Masashi Sugiyama
RECSYS
2009
ACM
14 years 2 months ago
FeedbackTrust: using feedback effects in trust-based recommendation systems
With the advent of online social networks, the trust-based approach to recommendation has emerged which exploits the trust network among users and makes recommendations based on t...
Samaneh Moghaddam, Mohsen Jamali, Martin Ester, Ja...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 9 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu