Sciweavers

1403 search results - page 28 / 281
» Set cover algorithms for very large datasets
Sort
View
EVOW
2005
Springer
14 years 2 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina
CIDU
2010
13 years 6 months ago
Multi-label ASRS Dataset Classification Using Semi Supervised Subspace Clustering
There has been a lot of research targeting text classification. Many of them focus on a particular characteristic of text data - multi-labelity. This arises due to the fact that a ...
Mohammad Salim Ahmed, Latifur Khan, Nikunj C. Oza,...
EACL
2006
ACL Anthology
13 years 9 months ago
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs pres...
Genevieve Gorrell
ICCV
2009
IEEE
15 years 1 months ago
Detecting Objects in Large Image Collections and Videos by Efficient Subimage Retrieval
We study the task of detecting the occurrence of objects in large image collections or in videos, a problem that combines aspects of content based image retrieval and object locali...
Christoph H. Lampert
ECML
2006
Springer
13 years 10 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra