Sciweavers

1068 search results - page 10 / 214
» Factorization as a Rank 1 Problem
Sort
View
94
Voted
ECML
2007
Springer
15 years 3 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 3 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SIAMDM
2010
114views more  SIAMDM 2010»
14 years 8 months ago
Rank-Based Attachment Leads to Power Law Graphs
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
Jeannette Janssen, Pawel Pralat
72
Voted
WWW
2007
ACM
15 years 10 months ago
On ranking techniques for desktop search
This paper addresses the desktop search problem by considering various techniques for ranking results of a search query over the file system. First, basic ranking techniques, whic...
Sara Cohen, Carmel Domshlak, Naama Zwerdling
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 4 months ago
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
Consensus clustering and semi-supervised clustering are important extensions of the standard clustering paradigm. Consensus clustering (also known as aggregation of clustering) ca...
Tao Li, Chris H. Q. Ding, Michael I. Jordan