Sciweavers

885 search results - page 40 / 177
» Random Matrices in Data Analysis
Sort
View
CVPR
1997
IEEE
14 years 9 months ago
Recursive Structure and Motion from Image Sequences using Shape and Depth Spaces
In this paper a novel recursive method for estimating structure and motion from image sequences is presented. The novelty lies in the fact that the output of the algorithm is inde...
Rikard Berthilsson, Anders Heyden, Gunnar Sparr
NIPS
2003
13 years 9 months ago
Limiting Form of the Sample Covariance Eigenspectrum in PCA and Kernel PCA
We derive the limiting form of the eigenvalue spectrum for sample covariance matrices produced from non-isotropic data. For the analysis of standard PCA we study the case where th...
David C. Hoyle, Magnus Rattray
AIED
2009
Springer
14 years 2 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 5 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 8 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu