543 search results - page 83 / 109 » Using Induction to Refine Information Retrieval Strategies |
WWW
2010
ACM
14 years 2 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
IRI
2008
IEEE
14 years 2 months ago
2008
IEEE
Associative classification has aroused significant attention recently and achieved promising results. In the rule ranking process, the confidence measure is usually used to sort t...
ISCC
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
IPM
2007
13 years 7 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...