Sciweavers

411 search results - page 19 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 5 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
JMLR
2010
173views more  JMLR 2010»
13 years 2 months ago
Collaborative Filtering via Rating Concentration
While most popular collaborative filtering methods use low-rank matrix factorization and parametric density assumptions, this article proposes an approach based on distribution-fr...
Bert Huang, Tony Jebara
IWCMC
2010
ACM
13 years 9 months ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton
PROFES
2004
Springer
14 years 1 months ago
Effort Estimation Based on Collaborative Filtering
Effort estimation methods are one of the important tools for project managers in controlling human resources of ongoing or future software projects. The estimations require histori...
Naoki Ohsugi, Masateru Tsunoda, Akito Monden, Ken-...