Sciweavers

356 search results - page 61 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
SPAA
2012
ACM
11 years 10 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
TIT
2011
134views more  TIT 2011»
13 years 2 months ago
Estimating Heavy-Tail Exponents Through Max Self-Similarity
: In this paper, a novel approach to the problem of estimating the heavy–tail exponent α > 0 of a distribution is proposed. It is based on the fact that block–maxima of siz...
Stilian Stoev, George Michailidis, Murad S. Taqqu
TCSV
2011
13 years 2 months ago
Integrating Spatio-Temporal Context With Multiview Representation for Object Recognition in Visual Surveillance
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...
Xiaobai Liu, Liang Lin, Shuicheng Yan, Hai Jin, We...
NIPS
2003
13 years 8 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
14 years 1 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...