Sciweavers

885 search results - page 8 / 177
» Random Matrices in Data Analysis
Sort
View
CSDA
2010
157views more  CSDA 2010»
14 years 9 months ago
Robust estimation of constrained covariance matrices for confirmatory factor analysis
Confirmatory factor analysis (CFA) is a data anylsis procedure that is widely used in social and behavioral sciences in general and other applied sciences that deal with large qua...
E. Dupuis Lozeron, M. P. Victoria-Feser
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
15 years 10 months ago
OptRR: Optimizing Randomized Response Schemes for Privacy-Preserving Data Mining
The randomized response (RR) technique is a promising technique to disguise private categorical data in Privacy-Preserving Data Mining (PPDM). Although a number of RR-based methods...
Zhengli Huang, Wenliang Du
BMCBI
2008
166views more  BMCBI 2008»
14 years 9 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
CISS
2010
IEEE
14 years 1 months ago
Concentration of measure for block diagonal matrices with repeated blocks
Abstract—The theoretical analysis of randomized compressive operators often relies on the existence of a concentration of measure inequality for the operator of interest. Though ...
Christopher J. Rozell, Han Lun Yap, Jae Young Park...
CORR
2007
Springer
74views Education» more  CORR 2007»
14 years 9 months ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger