Sciweavers

106 search results - page 9 / 22
» Finding Interesting Associations without Support Pruning
Sort
View
SIGIR
2008
ACM
14 years 10 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...
117
Voted
JMLR
2010
117views more  JMLR 2010»
14 years 4 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
CIKM
2009
Springer
15 years 4 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
IEEEVAST
2010
14 years 5 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
CAINE
2008
14 years 11 months ago
Hierarchical Clustering of Features on Categorical Data of Biomedical Applications
Data mining became increasingly important in bioinformatics and biomedical area during last decade. Various data mining methods, such as association rule mining and clustering, ha...
Yi Lu, Lily R. Liang