Sciweavers

3607 search results - page 129 / 722
» Learning with structured sparsity
Sort
View
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 2 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
IADIS
2003
13 years 9 months ago
Towards Interoperable Learning Object Repositories: The Ariadne Experience
In this paper, we present an approach for producing interoperable metadata by mapping metadata structures of application profiles into standard metadata structures. As a study cas...
Jehad Najjar, Erik Duval, Stefaan Ternier, Filip N...
ICML
2007
IEEE
14 years 9 months ago
Comparisons of sequence labeling algorithms and extensions
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...
Nam Nguyen, Yunsong Guo
CVPR
2006
IEEE
14 years 10 months ago
Image Denoising with Shrinkage and Redundant Representations
Shrinkage is a well known and appealing denoising technique. The use of shrinkage is known to be optimal for Gaussian white noise, provided that the sparsity on the signal's ...
Michael Elad, Boaz Matalon, Michael Zibulevsky
ICPR
2010
IEEE
13 years 10 months ago
Compressing Sparse Feature Vectors Using Random Ortho-Projections
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...
Esa Rahtu, Mikko Salo, Janne Heikkilä