Sciweavers

512 search results - page 9 / 103
» Ranking interesting subgroups
Sort
View
ECIR
2008
Springer
13 years 8 months ago
Expert Search Evaluation by Supporting Documents
An expert search system assists users with their "expertise need" by suggesting people with relevant expertise to their query. Most systems work by ranking documents in r...
Craig Macdonald, Iadh Ounis
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
14 years 19 days ago
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
13 years 8 months ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
DMIN
2006
132views Data Mining» more  DMIN 2006»
13 years 8 months ago
Discovering Accurate and Interesting Classification Rules Using Genetic Algorithm
Discovering accurate and interesting classification rules is a significant task in the post-processing stage of a data mining (DM) process. Therefore, an optimization problem exis...
Janaki Gopalan, Reda Alhajj, Ken Barker
TIT
2008
115views more  TIT 2008»
13 years 7 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins