Sciweavers

875 search results - page 35 / 175
» Linear Manifold Clustering
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
14 years 10 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
14 years 3 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
CVPR
2009
IEEE
15 years 4 months ago
Locally Time-Invariant models of Human Activities using Trajectories on the Grassmanian
Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities...
Pavan Turaga, Rama Chellappa
JC
2007
63views more  JC 2007»
13 years 9 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
Stephan Dahlke, Erich Novak, Winfried Sickel
IMSCCS
2007
IEEE
14 years 4 months ago
Linear Correlation Analysis of Numeric Attributes for Government Data
To analyze the linear correlations of numeric attributes of government data, this paper proposes a method based on the clustering algorithm. A clustering method is adopted to prun...
Ying Chen, Guochang Gu, Tian-yang Lv, Shaobin Huan...