Sciweavers

581 search results - page 68 / 117
» EM in High Dimensional Spaces
Sort
View
CGF
2010
171views more  CGF 2010»
14 years 7 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
15 years 8 months ago
Performance-oriented statistical parameter reduction of parameterized systems via reduced rank regression
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...
Zhuo Feng, Peng Li
MM
2005
ACM
122views Multimedia» more  MM 2005»
15 years 4 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
GRC
2010
IEEE
15 years 3 days ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
HPDC
2010
IEEE
15 years 3 days ago
Browsing large scale cheminformatics data with dimension reduction
Visualization of large-scale high dimensional data tool is highly valuable for scientific discovery in many fields. We present PubChemBrowse, a customized visualization tool for c...
Jong Youl Choi, Seung-Hee Bae, Judy Qiu, Geoffrey ...