Sciweavers

885 search results - page 10 / 177
» Random Matrices in Data Analysis
Sort
View
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 6 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
ICDM
2003
IEEE
98views Data Mining» more  ICDM 2003»
14 years 27 days ago
On the Privacy Preserving Properties of Random Data Perturbation Techniques
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large...
Hillol Kargupta, Souptik Datta, Qi Wang, Krishnamo...
INFORMATICALT
2006
154views more  INFORMATICALT 2006»
13 years 7 months ago
Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms f...
Rami Al Na'mneh, W. David Pan, Seong-Moo Yoo
CSDA
2008
115views more  CSDA 2008»
13 years 7 months ago
Complex-valued ICA based on a pair of generalized covariance matrices
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
Esa Ollila, Hannu Oja, Visa Koivunen
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 3 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...