Sciweavers

51 search results - page 3 / 11
» Discovering bucket orders from full rankings
Sort
View
DGO
2007
192views Education» more  DGO 2007»
13 years 9 months ago
D-HOTM: distributed higher order text mining
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
William M. Pottenger
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
13 years 9 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
IEEEICCI
2002
IEEE
14 years 12 days ago
Mining Fuzzy Rules in A Donor Database for Direct Marketing by a Charitable Organization
Given a donor database by a charitable organization in Hong Kong, we propose to use a new data mining technique to discover fuzzy rules for direct marketing. The discovered fuzzy ...
Keith C. C. Chan, Wai-Ho Au, Berry Choi