Sciweavers

4208 search results - page 313 / 842
» Better Selection of the Best
Sort
View
134
Voted
CLEF
2003
Springer
15 years 12 months ago
Comparing Weighting Models for Monolingual Information Retrieval
Motivated by the hypothesis that the retrieval performance of a weighting model is independent of the language in which queries and collection are expressed, we compared the retrie...
Gianni Amati, Claudio Carpineto, Giovanni Romano
GECCO
2003
Springer
163views Optimization» more  GECCO 2003»
15 years 12 months ago
Swarms in Dynamic Environments
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
T. M. Blackwell
IDEAL
2003
Springer
15 years 12 months ago
Experiences of Using a Quantitative Approach for Mining Association Rules
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
L. Dong, Christos Tjortjis
IWDW
2009
Springer
15 years 11 months ago
Fast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate ...
Marc Chaumont
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
15 years 11 months ago
Clustering with Lower Bound on Similarity
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...