Sciweavers

885 search results - page 79 / 177
» Random Matrices in Data Analysis
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
ICDM
2008
IEEE
184views Data Mining» more  ICDM 2008»
14 years 2 months ago
Bayesian Co-clustering
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...
Hanhuai Shan, Arindam Banerjee
IEEEPACT
1998
IEEE
14 years 1 days ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 8 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
ICASSP
2009
IEEE
13 years 5 months ago
Probabilistic matrix tri-factorization
Nonnegative matrix tri-factorization (NMTF) is a 3-factor decomposition of a nonnegative data matrix, X USV , where factor matrices, U, S, and V , are restricted to be nonnegativ...
Jiho Yoo, Seungjin Choi