440 search results - page 62 / 88 » A Fast Algorithm for Learning a Ranking Function from Large-... |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
NN
2002
Springer
13 years 7 months ago
2002
Springer
We propose a new scheme for enlarging generalized learning vector quantization (GLVQ) with weighting factors for the input dimensions. The factors allow an appropriate scaling of ...
WG
1993
Springer
14 years 3 days ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
KDD
2009
ACM
14 years 18 days ago
2009
ACM
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....