Sciweavers

157 search results - page 6 / 32
» Applying Discrete PCA in Data Analysis
Sort
View
ICML
2004
IEEE
14 years 8 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
FUIN
2007
104views more  FUIN 2007»
13 years 7 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
VIS
2003
IEEE
121views Visualization» more  VIS 2003»
14 years 8 months ago
Hierarchical Clustering for Unstructured Volumetric Scalar Fields
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate...
Christopher S. Co, Bjørn Heckel, Hans Hagen...
ICIP
2001
IEEE
14 years 9 months ago
Use of a probabilistic shape model for non-linear registration of 3D scattered data
In this paper we address the problem of registering 3D scattered data by the mean of a statistical shape model. This model is built from a training set on which a principal compon...
Isabelle Corouge, Christian Barillot
ICPR
2004
IEEE
14 years 8 months ago
Principal Component Analysis for Online Handwritten Character Recognition
In this paper, Principal Component Analysis (PCA) is applied to the problem of Online Handwritten Character Recognition in the Tamil script. The input is a temporally ordered sequ...
A. G. Ramakrishnan, Sriganesh Madhvanath, V. Deepu