Sciweavers

1403 search results - page 32 / 281
» Set cover algorithms for very large datasets
Sort
View
COLING
2008
13 years 10 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
BIBE
2007
IEEE
136views Bioinformatics» more  BIBE 2007»
13 years 10 months ago
A Two-Stage Gene Selection Algorithm by Combining ReliefF and mRMR
Abstract—Gene expression data usually contains a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes ...
Yi Zhang, Chris H. Q. Ding, Tao Li
DAS
2006
Springer
14 years 4 days ago
Aligning Transcripts to Automatically Segmented Handwritten Manuscripts
Abstract. Training and evaluation of techniques for handwriting recognition and retrieval is a challenge given that it is difficult to create large ground-truthed datasets. This is...
Jamie L. Rothfeder, R. Manmatha, Toni M. Rath
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 3 months ago
Large-Scale Collective Entity Matching
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being app...
Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofala...
ICDIM
2008
IEEE
14 years 2 months ago
A holographic associative memory recommender system
We describe a recommender system based on Dynamically Structured Holographic Memory (DSHM), a cognitive model of associative memory that uses holographic reduced representations a...
Matthew Rutledge-Taylor, Andre Vellino, Robert L. ...