Sciweavers

122 search results - page 6 / 25
» Scalable and Interpretable Data Representation for High-Dime...
Sort
View
GRC
2010
IEEE
14 years 11 months 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
BMCBI
2010
243views more  BMCBI 2010»
14 years 10 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
SSDBM
2007
IEEE
110views Database» more  SSDBM 2007»
15 years 4 months ago
On Exploring Complex Relationships of Correlation Clusters
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
ICMLA
2007
14 years 12 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
ICDE
2006
IEEE
174views Database» more  ICDE 2006»
15 years 11 months ago
Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format
"Sparse" data, in which relations have many attributes that are null for most tuples, presents a challenge for relational database management systems. If one uses the no...
Jennifer L. Beckmann, Alan Halverson, Rajasekar Kr...