Sciweavers

1016 search results - page 179 / 204
» Generalized distances between rankings
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
ICALP
2009
Springer
14 years 10 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
SIGMOD
2007
ACM
413views Database» more  SIGMOD 2007»
14 years 10 months ago
Effective keyword-based selection of relational databases
The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...
Bei Yu, Guoliang Li, Karen R. Sollins, Anthony K. ...
POPL
2010
ACM
14 years 7 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
WWW
2010
ACM
14 years 5 months ago
Context-aware citation recommendation
When you write papers, how many times do you want to make some citations at a place but you are not sure which papers to cite? Do you wish to have a recommendation system which ca...
Qi He, Jian Pei, Daniel Kifer, Prasenjit Mitra, C....