Sciweavers

734 search results - page 109 / 147
» A New Indexing Method for High Dimensional Dataset
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 1 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
ICCV
2001
IEEE
16 years 2 months ago
Robust Principal Component Analysis for Computer Vision
Principal Component Analysis (PCA) has been widely used for the representation of shape, appearance, and motion. One drawback of typical PCA methods is that they are least squares...
Fernando De la Torre, Michael J. Black
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 6 months ago
Evolutionary form-finding of tensegrity structures
Tensegrity structures are stable 3-dimensional mechanical structures which maintain their form due to an intricate balance of forces between disjoint rigid elements and continuous...
Chandana Paul, Hod Lipson, Francisco J. Valero Cue...
110
Voted
EMMCVPR
2001
Springer
15 years 5 months ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...
ICASSP
2010
IEEE
15 years 1 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...