Sciweavers

151 search results - page 7 / 31
» Efficient feature weighting methods for ranking
Sort
View
CIKM
2006
Springer
14 years 27 days ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
AUSAI
2006
Springer
14 years 27 days ago
An Efficient Alternative to SVM Based Recursive Feature Elimination with Applications in Natural Language Processing and Bioinfo
The SVM based Recursive Feature Elimination (RFE-SVM) algorithm is a popular technique for feature selection, used in natural language processing and bioinformatics. Recently it wa...
Justin Bedo, Conrad Sanderson, Adam Kowalczyk
CIKM
2009
Springer
14 years 5 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
SIGIR
2008
ACM
13 years 10 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
ICML
2009
IEEE
14 years 11 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis