Sciweavers

512 search results - page 18 / 103
» Ranking interesting subgroups
Sort
View
PVLDB
2011
13 years 2 months ago
Hyper-local, directions-based ranking of places
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
Petros Venetis, Hector Gonzalez, Christian S. Jens...
CIIA
2009
13 years 8 months ago
Ontology-Driven Method for Ranking Unexpected Rules
Several rule discovery algorithms have the disadvantage to discover too much patterns sometimes obvious, useless or not very interesting to the user. In this paper we propose a new...
Mohamed Said Hamani, Ramdane Maamri
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
14 years 7 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
AIRS
2010
Springer
13 years 5 months ago
Learning to Rank with Supplementary Data
This paper is concerned with a new task of ranking, referred to as "supplementary data assisted ranking", or "supplementary ranking" for short. Different from c...
Wenkui Ding, Tao Qin, Xu-Dong Zhang
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 1 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri