Sciweavers

5592 search results - page 499 / 1119
» On Random Betweenness Constraints
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 9 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
AAAI
2011
14 years 6 months ago
Quantity Makes Quality: Learning with Partial Views
In many real world applications, the number of examples to learn from is plentiful, but we can only obtain limited information on each individual example. We study the possibiliti...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CVPR
2012
IEEE
13 years 9 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
IMC
2004
ACM
16 years 9 days ago
Constraint-based geolocation of internet hosts
— Geolocation of Internet hosts enables a diverse and interesting new class of location-aware applications. Previous measurement-based approaches use reference hosts, called land...
Bamba Gueye, Artur Ziviani, Mark Crovella, Serge F...
BMCBI
2008
124views more  BMCBI 2008»
15 years 7 months ago
A relation based measure of semantic similarity for Gene Ontology annotations
Background: Various measures of semantic similarity of terms in bio-ontologies such as the Gene Ontology (GO) have been used to compare gene products. Such measures of similarity ...
Brendan Sheehan, Aaron J. Quigley, Benoit Gaudin, ...