Sciweavers

119 search results - page 8 / 24
» Comparing the sensitivity of information retrieval metrics
Sort
View
IR
2006
14 years 9 months ago
Evolving local and global weighting schemes in information retrieval
This paper describes a method, using Genetic Programming, to automatically determine term weighting schemes for the vector space model. Based on a set of queries and their human de...
Ronan Cummins, Colm O'Riordan
BMCBI
2008
187views more  BMCBI 2008»
14 years 9 months ago
PSAT: A web tool to compare genomic neighborhoods of multiple prokaryotic genomes
Background: The conservation of gene order among prokaryotic genomes can provide valuable insight into gene function, protein interactions, or events by which genomes have evolved...
Christine Fong, Laurence Rohmer, Matthew Radey, Mi...
ICCBR
2003
Springer
15 years 2 months ago
Unifying Weighting and Case Reduction Methods Based on Rough Sets to Improve Retrieval
Case-Based Reasoning systems usually retrieve cases using a similarity function based on K-NN or some derivatives. These functions are sensitive to irrelevant or noisy features. We...
Maria Salamó, Elisabet Golobardes
CIKM
2009
Springer
15 years 4 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales